Implement an algorithm to solve the 8 Puzzle Problem.

The 8 puzzle consists of eight numbered, movable tiles set in a 3x3 frame. One cell of the frame is always empty thus making it possible to move an adjacent numbered tile into the empty cell. The program is to change the initial configuration into the goal configuration. A solution to the problem is an appropriate sequence of moves, such as move tiles 5 to the right, move tile 7 to the left, move tile 6 to the down, etc.

The program is to change the initial configuration into the goal configuration. A solution to the problem is an appropriate sequence of moves, such as move tiles 5 to the right, move tile 7 to the left, move tile 6 to the down, etc.