Recursive thinking, made visible

Tower of Hanoi

Move every disc from A to C by repeatedly solving a smaller version of the same puzzle.

4 discs
15 minimum moves

The problem

Move the tower without breaking the stack rules

Start with all discs sorted on the left peg and move the complete tower, still sorted, to the right peg.

Only one top disc at a time Never place a bigger disc on a smaller disc All discs start on peg A and must be sorted on peg C

Puzzle state

Discs on sticks

0 / 15

Generated solution

Move list

Click any move to jump there.