How do you solve the 15-puzzle with A-Star or Dijkstra's Algorithm?

Question

I\'ve read in one of my AI books that popular algorithms (A-Star, Dijkstra) for path-finding in simulation or games is also used to solve the well-known \"15-puzzle\".

C

Answer 1

Just use the game tree. Remember that a tree is a special form of graph.

In your case the leaves of each node will be the game position after you make one of the moves that is available at the current node.