For the questions below, recall the Towers of Hanoi recursive solution.
-If there are 2 disks to move from one Tower to another, how many disk movements would it take to solve the problem using the recursive solution?
A) 0
B) 1
C) 2
D) 3
E) 4

Question

Quizplus · Accepted Answer

D) The Towers of Hanoi solution requires using the previous solution twice + 1 extra move. To solve it for 1 disk, it takes 1 move. To solve it for 2 disks, it takes using the solution for 1 disk twice + 1, or 1 move + 1 move + 1 move = 3 moves. We capture this in the equation 2ⁿ - 1 where n is the number of disks.

For the Questions Below, Recall the Towers of Hanoi Recursive