A Double Tower of Hanoi contains 2n disks of n different sizes, two of each size. As usual, we’re required to move only one disk at a time, without putting a larger one over a smaller one. a. How many moves does it take to transfer a double tower from one peg to another, if disks of equal size are indistinguishable from each other? b. What if we are required to reproduce the original top-to-bottom order of all the equal-size disks in the final arrangement?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
