The Tower of Hanoi is a perfect puzzle for an elementary school science project. If you add disks one at a time and investigate “the fewest moves”, you will see a mysterious rule in the numbers. You can make the equipment by hand, and you can finish in a day or a few days. (In Japan, elementary school students often do a summer “independent research” project like this.)

Examples of Research Themes

  • How does the fewest number of moves change when you add one disk?
  • If there were 64 disks, how many years would it take to move them?
  • How many times does the smallest disk move?

Here we explain the steps for the first theme.

What You Need

  • A Tower of Hanoi (you can make one from cardboard or coins, as in the article on making one. It is safest to have 6 disks)
  • A notebook for records, and a pencil
  • If you have them, tally marks on paper or a counter to count the moves

You can also try it on the board at the bottom of this page.

How to Run the Experiment

  1. Check the rules: Move only one disk at a time. Never put a large disk on a small one. When you have moved the left tower completely to the right, you are done.
  2. Start with 1 disk: Finish with 1 disk, 2 disks, 3 disks… adding one disk at a time.
  3. Count the moves: Count each time you move a disk as 1 move.
  4. Try several times and record the fewest moves: At first, taking a detour is fine. Try several times and find the number of moves that you cannot reduce any more.

Example Record Table

Number of disksFewest movesRelation to the previous number
1 disk1 move―
2 disks3 moves1 × 2 + 1
3 disks7 moves3 × 2 + 1
4 disks15 moves7 × 2 + 1
5 disks31 moves15 × 2 + 1
6 disks??

The numbers of moves in the table are the answers when it is done correctly. First count them yourself, and compare afterward.

Finding the Rule

When you have the records, look closely at the sequence of moves, “1, 3, 7, 15, 31”.

  • Double the previous number of moves and add 1, and you get the next number: 3 × 2 + 1 = 7, 7 × 2 + 1 = 15.
  • If you add 1 to the number of moves, you get numbers that double each time: 2, 4, 8, 16, 32.

Let’s also think about why it is “double it and add 1”. For example, to move 4 disks, you need to

  1. Move the top 3 disks aside to the middle (the same number of moves as moving 3 disks)
  2. Move the largest disk to the right (1 move)
  3. Move the 3 disks in the middle to the right (again, the same number of moves as moving 3 disks)

That is the moves for 3 disks twice, plus 1 move. That is why it is “double it and add 1”.

Predict, Then Check

Once you know the rule, predict the number of moves for 6 disks, and then check by actually doing it. It should be 31 × 2 + 1 = 63 moves. If it comes out as you predicted, that confirms the rule is right.

Then extend your predictions to 7 disks (127 moves) and 10 disks (1,023 moves). With 64 disks, the number becomes very large. Even at one move per second, it works out to about 584.5 billion years (How Many Years Would 64 Disks Take?).

Example Ways to Present It

When you put it together on poster board or drawing paper, this order makes it easy to follow.

  1. What got you started: How you came across the Tower of Hanoi, and what you found mysterious.
  2. The rules of the Tower of Hanoi: Explain with drawings.
  3. How you investigated: Up to how many disks, and how you counted.
  4. Results: The record table and a graph of the moves (put the number of disks along the bottom and the moves up the side, and you can see how fast it climbs).
  5. What you found out: The rule you found, and the reason for it.
  6. Thoughts, and what you want to look into more: The legend of the 64 disks, what happens with four poles, and so on.

If you also introduce the history and legend of the Tower of Hanoi (Origins and Legend), it makes a presentation that is fun for readers too.

Give It a Try

The board below starts with 3 disks. Change the number of disks and look for the fewest moves. It counts the moves for you automatically.

321
Moves: 0 (fewest 7)

Move the whole tower from the left pole to the right pole. Tap a pole to pick up its top disk.