Tower of Hanoi — play the free puzzle

How it works

1. Discs begin stacked on the first peg, largest at the bottom.
2. Move one disc at a time to another peg.
3. Never place a larger disc upon a smaller disc.
4. Goal: rebuild the full tower on the last peg.
5. Try fewer discs first; add discs as confidence grows.

The mathematical idea

Optimal play for n discs reduces to moving n−1, moving the largest, then moving n−1 again — the essence of recursion and exponential growth (minimum moves: 2ⁿ − 1). Children meet the idea as a felt pattern: smaller towers nest inside larger ones.

Why it helps

Hanoi trains planning, working memory, and respect for constraints — virtues classical education values. It is not arithmetic drill; it is mathematical thinking. Homeschool and classical students who like quiet puzzles often find a satisfying depth without competition pressure.

Age & skill range. Ages 6–8 with 3 discs and help; ages 8+ toward 4–5 discs. Older students may explore the recursive structure explicitly.

How to play

The Tower of Hanoi puzzle starts with discs stacked on the first of three pegs, largest at the bottom. Move one disc at a time. Never set a larger disc on a smaller one. Rebuild the full tower on the last peg. Begin with three discs. Add a disc only when the shorter tower already feels calm.

Minimum moves (2^n − 1)

The shortest solution for n discs is 2ⁿ − 1. To move n discs, first move the n−1 tower out of the way, move the largest disc once, then move that n−1 tower on top of it. Three discs take 7 moves. Four take 15. Five take 31. Each new disc doubles the work and adds one. This simulator lets you count those moves without a timer.

A short history

Édouard Lucas published the puzzle in 1883 and called it the Tower of Hanoi. He told a story of monks moving a tower of golden discs, one disc at a time, under the same size rule. The legend is decoration. The mathematics is the recursive count, which is why the puzzle still sits in classical classrooms.

Questions

How do you play Tower of Hanoi?

Three pegs, one stack of discs, largest on the bottom. Move one disc at a time. Never place a larger disc on a smaller one. Rebuild the whole tower on the last peg. Start with three discs, then add more.

What is the minimum number of moves in Tower of Hanoi?

The shortest solution for n discs is 2ⁿ − 1. Three discs take 7 moves. Four take 15. Five take 31. Each added disc doubles the previous tower and adds one move for the largest disc.

Where did the Tower of Hanoi come from?

Édouard Lucas, a French mathematician, published the puzzle in 1883 under the name Tower of Hanoi. He wrapped it in a story of monks moving golden discs. The mathematics is the recursive move count, not the legend.