// Free Game

TOWER OF HANOI

Move the whole stack of discs from the first peg to the last. Only one disc at a time, and never place a larger disc on a smaller one. Click a peg to lift its top disc, then click another to drop it — or drag. Runs entirely in your browser, nothing to install.

The Puzzle
Moves
0
Optimal (2ⁿ−1)
7
Discs left to move
3
Move the stack from peg A to peg C.

Tip: the minimum number of moves for n discs is 2ⁿ−1 — that is 7 for 3 discs, and 255 for 8. Try to match it. Keyboard: Tab to a peg and press Enter to pick up or drop the top disc.