Akramovic1/8Puzzle-Game

the 8-puzzle game consists of a board holding 8 distinct movable tiles, plusan empty space. For any such board, the empty space may be legally swapped with any tilehorizontally or vertically adjacent to it. In this assignment, the blank space is going to berepresented with the number 0.Given an initial state of the board, the search problem is to find a sequence of moves that tran-sitions this state to the goal state; that is, the configuration with all tiles arranged in ascendingorder 0,1,2,3,4,5,6,7,8 .The search space is the set of all possible states reachable from the initial state. The blankspace may be swapped with a component in one of the four directions ’Up’, ’Down’, ’Left’,’Right’, one move at a time. The cost of moving from one configuration of the board to anotheris the same and equal to one. Thus, the total cost of path is equal to the number of movesmade from the initial state to the goal state.

JavaMIT