- #1
hansel13
- 51
- 0
The double tower of Hanoi puzzle contains 2n discs. There are n different sizes, two
of each size. Initially one of the poles contains all the disks placed on top of each other in decreasing size. Discs of the same size are identical. You are allowed to
place discs of the same size on top of each other. Let an be the minimum number of moves
need to solve the puzzle. Find a recurrence relation for a1, a2, a3, ...
This is what I came up with, and wanted to see if it was right:
a1 = 3
an = 2an-1 + 2.
Is this correct?
thanks
of each size. Initially one of the poles contains all the disks placed on top of each other in decreasing size. Discs of the same size are identical. You are allowed to
place discs of the same size on top of each other. Let an be the minimum number of moves
need to solve the puzzle. Find a recurrence relation for a1, a2, a3, ...
This is what I came up with, and wanted to see if it was right:
a1 = 3
an = 2an-1 + 2.
Is this correct?
thanks