Tower of Hanoi is a classic mathematical puzzle introduced in 1883. The objective is to move an entire stack of disks from one peg to another, following three simple rules.
Rules:
Only one disk may be moved at a time
Each move takes the top disk from one peg and places it on top of another peg
A disk may never be placed on top of a smaller disk
How to play: Click a peg to lift its top disk (the disk rises and the rod turns gold). Click a second peg to drop it there, or click the same peg again to cancel. Illegal moves are simply ignored and are not counted.
Minimum moves in Classic mode:
The minimum is 2ⁿ − 1 moves, where n is the number of disks
Random Start mode scatters the disks across all three pegs. The minimum move count is calculated for that exact position using a shortest-path search, so your efficiency score stays accurate.
Strategy tip: Think recursively. To move n disks from A to C, first move n−1 disks from A to B, then move the largest disk from A to C, then move the n−1 disks from B to C.