1) 8 Puzzle Problem (A* search algorithm is required) 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. Such a puzzle is illustrated in following diagram. N 2 16 1 8 7 3 4 5 6 Goal Initial 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 "blank tile to the right, blank tiles to the up, blank tile to the up, ..." OR "move tile 5 to the right, move tile 7 to the left, move tile 6 to the down, ..." 1) 8 Puzzle Problem (A* search algorithm is required) 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. Such a puzzle is illustrated in following diagram. N 2 16 1 8 7 3 4 5 6 Goal Initial 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 "blank tile to the right, blank tiles to the up, blank tile to the up, ..." OR "move tile 5 to the right, move tile 7 to the left, move tile 6 to the down