Little Tommy is trying to solve the *Tower of Hanoi* with 5 disks.

The objective of the puzzle is to move the entire stack from one rod to another, following simple rules :

• Only one disk can be moved at a time.

• Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.

• No disk can be placed on top of a smaller disk.

His mom asks him to finish the game quickly and get back to his homework.

What is the minimum number of moves required to solve the puzzle ?

×

Problem Loading...

Note Loading...

Set Loading...