Here are short answers to questions people often ask about the Tower of Hanoi. Links to articles with more detail are included.

What Is the Tower of Hanoi?

It is a solo puzzle played with three poles and disks of different sizes. A tower of disks stacked on one pole has to be moved, following the rules, entirely to another pole. The French mathematician Édouard Lucas put it on sale in 1883. The rules are in What Is the Tower of Hanoi?.

What Is It Called in Other Languages?

In English it is the Tower of Hanoi, or the Towers of Hanoi. In Japanese it is “Hanoi no Tō”, and in Chinese it is “Hànnuò Tǎ”. It is also sometimes called the “Tower of Brahma”, after the setting of the legend.

What Are the Rules? What Moves Are Illegal?

There are three rules. You can move only one disk at a time, you can move only the top disk on each pole, and you must not put a large disk on a small disk. These moves are illegal:

  • Moving two or more disks together.
  • Lifting or pulling out a lower disk along with the disks above it.
  • Putting a large disk on top of a small disk.
  • Leaving a disk anywhere other than a pole (such as on the table).

What Age Can Children Start?

As a rough guide, children can move a tower by the rules from around age 5 or 6, and enjoy 2 or 3 disks. Around ages 3 to 4, they can enjoy just stacking the disks from largest to smallest (The Tower of Hanoi with Children).

How Many Disks Do People Usually Play With?

The classic number is 7 disks (127 moves at the fewest). If you are a beginner, start with 3 disks and add more as you get used to it (difficulty by number of disks).

What Is the Fewest Number of Moves?

With n disks, it is 2ⁿ − 1 moves: 7 moves for 3 disks, 31 for 5, 127 for 7, and 1,023 for 10. The moves for each number of disks are in the answer chart, and the reason for the formula is in the minimum-moves formula.

Where Should I Make the First Move?

Move the smallest disk to the pole you want to reach if the number of disks is odd, and to the other pole if it is even. The moves after that are in the article on how to solve it.

Is It Always Solvable?

Yes. It can always be solved, however many disks there are. What is more, it is known that from any legal arrangement you can always reach any other legal arrangement (the article on patterns).

Does Moving to the Middle Pole Count as Finished?

Yes. The original rule is “move the whole tower to another pole”, so the middle or the right both count. The Classic mode in the Tower of Hanoi app moves the tower to the middle pole, and if you turn on “Allow completion on the right pole” in Settings, moving it to the right pole counts as finished too.

How Long Would 64 Disks Take?

At least about 18.4 quintillion moves. Even at one move per second, it takes about 584.5 billion years (How Many Years Would 64 Disks Take?).

What Happens with Four Poles?

The number of moves drops sharply. For example, with 8 disks it is 255 moves with three poles but 33 moves with four (The Tower of Hanoi with Four Poles).

Why Is It Called “Hanoi”?

Hanoi is the capital of Vietnam, but no connection between the puzzle and Vietnam is known. It is thought that the name was chosen because it sounded far away and exotic when the puzzle went on sale (Origins and Legend).

Where Can I Play It?

You can play right away on the boards in this site’s articles, at no cost. On a phone, you can also download the Tower of Hanoi app (iPhone, iPad and Android) at no cost (Where to Play).