There are three pegs, and on one of them, there are four disks of distinct sizes, as shown in the picture. Steve wants to move all four of the disks from the left peg to the right peg following these rules:

- Only one disk can be moved at a time.
- Each move consists of taking the uppermost disk from one of the stacks and placing it on top of another stack.
- No disk may be placed on top of a smaller disk.

Here is how Steve has managed to solve the puzzle partially in 7 steps, by taking the top 3 disks from the left peg to the middle peg:

How many *more* steps would he need to solve the entire puzzle?

×

Problem Loading...

Note Loading...

Set Loading...