Tower of Hanoi
Move the full stack to the target in as few moves as you can.
Choose 3–8 disks and play immediately. Exact minimum moves, a visual next-move Hint, clean personal bests and fast tap/drag/keyboard controls stay beside the board; deeper analysis is optional below.
Move every disk to the target peg without placing a larger disk on a smaller one.
More controls & exact stats
Advanced analysis & repeatability lab
V0.202 Solve Quality & Repeatability Lab
Every legal move is compared with the exact shortest-path distance of the state before and after the move. Review detours and reversals locally, then repeat the same fixed 4-peg benchmark. No percentile, IQ or population norm is inferred.
Play a legal move to build exact state-graph evidence.
Use Optimal Route on the main game or lab board. Revealing a full route marks that run Assisted.
Fixed Benchmark · same 4-peg / 7-disk state
The benchmark uses one deterministic verified Standard source every clean run. Its par is the exact BFS graph distance. Full route, interruption, Check or Hint excludes a run from Clean 5.
Ready for Fixed Benchmark or Adaptive Drill.
Clean 5 repeatability
Recent benchmark evidence
No benchmark evidence yet.
Local evidence backup & accessibility
Export or import only this device’s Hanoi progress and V0.202 lab evidence. Display settings never alter puzzle identity, exact par or legal moves.
How it works
Par is an exact graph distance
The verifier enumerates every legal state for each bundled peg/disk configuration. The displayed par is the actual shortest number of legal moves from the generated start state to its target peg.
Detour overhead is live
Moves made plus exact moves remaining can be compared with the starting par. If that total grows, you have taken a real detour; if it stays equal to par, an optimal finish is still possible.
Hint starts from where you are
Hint inspects all legal next moves from the current state and highlights one whose independently measured distance is exactly one smaller. It never moves a disk for you or assumes you followed a memorized source route.
Classic and scrambled training
Classic 3–8 starts with every disk stacked on peg 1 and targets peg 3, with exact minimum 2ⁿ−1. Scrambled Easy uses three pegs; Standard and Challenge use four pegs with deeper verified states and more legal choices.
Clean and Assisted records
Using Check or Verified Hint marks the run Assisted. Clean solves keep separate best move/time records so a perfect-par solve remains meaningful without hiding assisted completions.
Project-local generation
No remote puzzle feed or runtime solver service is required. Source states are generated locally, frozen into the project, and independently rechecked by a separate exact BFS verifier during release QA.