Home /
Expert Answers /
Computer Science /
consider-the-recursive-towers-of-hanoi-algorithm-suppose-that-you-changed-the-second-game-rule-to-pa526
(Solved): Consider the recursive Towers of Hanoi algorithm. Suppose that you changed the second game rule to ...
Consider the recursive Towers of Hanoi algorithm. Suppose that you changed the second game rule to allow you to move two disks (which must be in legal size order) at the same time instead of one. For example, in a tower of size 3 , move both the smallest disk and medium disk from the top at the same time. Would the algorithm still require exponential time? Answer yes/no, and explain.
Expert Answer
With two disks grouped (disks 1 and 2 grouped, the group will be called 1-2), the algorith