The Towers of Hanoi is a very simple, yet interesting puzzle. You have to move all the disks to the rightmost pole, while respecting the following rules:

- In each step, all you can do is to remove exactly one disk from the top of one pole stack and place it on the top of another stack.
- You can never place a disk of larger size on top of a smaller size.

Hannah's Towers of Hanoi has three disks, as in the picture above.

However, she knows that if there were 2 disks, instead of 3, it would take her 3 steps, like this:

Using this fact, can you figure out how many steps it would take for Hannah if she wanted to solve for 3 disks?

×

Problem Loading...

Note Loading...

Set Loading...