Skip to content
STEM Little Explorers
HR

Tower of Hanoi

Move the whole stack to the last peg in as few moves as you can. Test yourself in this classic puzzle of logic and patience.

Disks
Moves: 0
Fewest possible: 7

Tap a peg to pick up its top disk, then tap another peg to drop it. Move the whole stack to the last peg. Rule is that a bigger disk can never sit on a smaller one.

How to use this tool

  1. 1Choose how many disks you want in the puzzle.
  2. 2Move one top disk at a time to another peg.
  3. 3Build the full tower on the last peg without placing a larger disk on a smaller one.

What you can learn

  • A large problem becomes manageable when split into smaller repeats.
  • Every extra disk doubles most of the work.
  • Planning ahead uses fewer moves than trial and error.

Keep exploring

More free tools and games you can try next.

Advertisement