How to play Tower of Hanoi — the 3 rules

  1. Move only one disk at a time. Pick up a single disk with each move — no grabbing two at once.
  2. Only the top disk can move. You cannot dig a disk out from the middle or bottom of a stack.
  3. A bigger disk may never rest on a smaller disk. This is the golden rule that makes the puzzle what it is — every landing rod must stay ordered from biggest (bottom) to smallest (top).

Your goal: transfer the whole tower from the first rod to the last one, following the three rules above. It sounds easy with 3 disks — try 7 and you will feel your brain heat up.

The legend of the 64 golden disks

An old legend tells of a temple where priests (some versions say monks) were given 64 golden disks stacked on one of three diamond posts, with the order that they move the entire tower to another post following the sacred rules — one disk at a time, never a larger on a smaller. The legend says that when the final disk lands, the world will end. Beautiful story — and the math shows it will not happen any time soon: a perfect solution needs 264 − 1 moves. At one move per second, that is about 585 billion years — far longer than the age of the universe. So you can safely practice your 7-disk tower here.

Minimum moves: the 2n − 1 table

The smallest possible number of moves for n disks is exactly 2n − 1. Beat this target and you have played a perfect game:

Disks34567
Minimum moves7153163127

Every disk you add doubles the difficulty — 7 disks need 127 moves, which is why this puzzle is used to teach exponential growth in math classes.

Strategy tips — solve it like a mathematician

  • The smallest-disk rhythm: move the smallest disk on every other move. Alternate: smallest disk, then a big move, then smallest disk again.
  • Always send the smallest disk the same direction: if you have an odd number of disks (3, 5, 7), the first smallest-disk move goes to the target rod; if even (4, 6), it goes to the middle rod. Keep going that way around every time.
  • Think recursively: to move n disks, first move the top n−1 disks out of the way, then move the largest disk, then rebuild the stack on top of it. Solve the small tower first — the big disk takes care of itself.
  • Never move the same disk twice in a row (unless you are forced) — that is a sign of an wasted move.
  • Count your moves out loud: knowing the 2n − 1 target (7, 15, 31, 63, 127) turns practice into a game of beating your own score.
💡 Did you know? The Tower of Hanoi puzzle was invented by the French mathematician Édouard Lucas in 1883. He sold it as a toy called "La Tour d'Hanoï" — and teachers have used it ever since to train planning, patience and logical thinking.

Why Tower of Hanoi is good for your brain

This puzzle is a favourite in classrooms and psychology labs because it quietly trains three powerful skills at once: planning ahead (you must think several moves deep), working memory (you hold the whole plan in your head), and patience (a rushed move with 7 disks can cost you dozens of extra moves). Kids love the clink-and-stack feeling of moving the disks, students discover recursion without fear, and grandparents get a gentle daily brain workout. Family-friendly, screen-calm, and free — play a round every day.

Frequently asked questions

What is the Tower of Hanoi game?

Tower of Hanoi is a classic math puzzle with three rods and a stack of disks. You must move the whole stack from the first rod to another rod, moving one disk at a time, never placing a bigger disk on a smaller one. It trains planning, patience and working memory.

What is the minimum number of moves for n disks?

The perfect solution needs exactly 2^n − 1 moves. So 3 disks need 7 moves, 4 disks need 15, 5 disks need 31, 6 disks need 63 and 7 disks need 127 moves. This page shows the minimum target for the disk count you pick and awards a Perfect Solution badge when you match it.

What is the trick to solving Tower of Hanoi fast?

Move the smallest disk on every other move, always in the same direction. With an odd number of disks, send the first smallest-disk move to the target rod; with an even number, send it to the middle rod. Then think recursively: move the top n−1 stack aside, move the largest disk, and rebuild the stack on top of it.

Is Tower of Hanoi good for the brain?

Yes. Researchers and teachers use it to train planning ahead, working memory and logical thinking. Because every move must be legal, it also builds patience and careful decision-making — great for kids and students.

Can I play Tower of Hanoi on my phone?

Yes — this version is fully mobile-friendly. Just tap a rod to lift its top disk, then tap the rod where you want to drop it. The tap targets are large, and there is nothing to download or install.

🔗 See also