8 puzzle vs 15 puzzle
Same rules, two very different planning problems. This guide explains how the two board sizes differ, why only some shuffles are solvable, and why the game reports an optimal move count on the 3×3 board but a verified reference path on the 4×4 board. Ready to slide? Play Sliding Puzzle Sprint.
Board size changes the problem
The 8 puzzle is a 3×3 grid with eight tiles; the 15 puzzle is 4×4 with fifteen. On the small board, a wrong move costs little — you can see the whole position at a glance and repair a plan in two or three slides. On the 4×4 board, tiles interact across rows: fixing the top row can quietly scramble the middle, so each stage needs a planned sequence instead of a local correction.
Not every shuffle is solvable
Every sequence of legal slides preserves a parity property of the position: whether the tile order plus the blank’s row is even or odd. Half of all possible arrangements have the wrong parity and can never be solved, no matter how long you slide. Every board AhaArcade generates is verified solvable before it reaches you, so a stuck feeling always means the plan needs rethinking, not the board.
Optimal moves vs a reference path
3×3 — verified optimal count: the 8 puzzle has few enough positions that the shortest solution for your exact board can be computed completely. The number you see is the true minimum number of moves from the start position to the goal.
4×4 — verified reference path: computing a provably shortest solution for the 15 puzzle is far harder, so the game instead shows the length of a reference path produced by a verified solving procedure. It is a real, complete solution you can compare your route against — an upper bound you can beat on lucky boards, not a certified minimum.
The two numbers answer different questions on purpose: “the best possible” on the small board, “a solution you can check against” on the big one.
What you see after solving
Finish a board and the game rebuilds your run from the first position, move by move, with Play, Pause, single steps, and a scrub bar. On the 8 Puzzle it also computes the exact optimal move count, so the panel reads Optimal: N moves. The 15 Puzzle shows Verified reference: N moves — a path re-verified step by step, never a claim of optimality.