Nine Tile Problem
The problem consists of a permutation of tiles numbered 1-8 arranged in a 3x3 matrix along with a blank tile.
The aim is find the steps in order to arrange the 3x3 matrix of tiles in the following order:
- The blank tile can be swapped with any non-diagonal adjacent tile (Left, Right, Up, Down)
- No other movement/swap is allowed.
Example Initial Configuration
An initial configuration might be unsolvable.
AStar search is the most widely known form of best-first search that aims at minimizing the total estimated solution cost. This is achieved by the search strategy by using heuristic functions in order to optimize decision making.