A sliding (or 15β) puzzle consists of NΓN tiles numbered 1 β¦ NΒ²β1 and one empty space. The objective is to reach a goal configuration by sliding tiles into the blank.
The most common admissible heuristic is the sum of Manhattan distances of each tile from its goal cell. Because a single slide can reduce this sum by at most one, the heuristic provides a lower bound on the number of moves required.
Parity of the permutation determines solvability; when the puzzle is solvable, the heuristic together with a parity correction gives a quick estimate of the minimum move count.
What is a sliding puzzle?
How does the Manhattan distance heuristic work?
What determines if a sliding puzzle is solvable?
Can this calculator solve any size of sliding puzzle?
What is the significance of the empty space in a sliding puzzle?
How does this calculator determine the minimum number of moves?
Can I use this calculator for a 5Γ5 sliding puzzle?
Results are for informational purposes only and do not constitute professional advice.
