Please help!
A Double Tower of Hanoi contains 2n disks of n different sizes, two of each size. We're required to move only one disk at a time, without putting a larger one over a smaller one. How many moves does it take to transfer a double tower from one peg to another, if we are also required to reproduce the original top-to-bottom order of all the equal-size disks in the final arrangement?

Question

Please help!
A Double Tower of Hanoi contains 2n disks of n different sizes, two of each size. We're required to move only one disk at a time, without putting a larger one over  a smaller one. How many moves does it take to transfer a double tower from one peg to another, if we are also required to reproduce the original top-to-bottom order of all the equal-size disks in the final arrangement?

anonymous · Answer

You realize that Tower of Hanoi and Double Tower of Hanoi problems are really better asked in the computer science area (does Openstudy have a separate compsci area, maybe not, but I thought so) because of the recursive nature of the solution, and that this question is a classic compsci question.

anonymous · Answer

ok, thank you