Recall the Towers of Hanoi recursive solution for this problem. If there are six disks to move from one Tower to another, how many disk movements would it take to solve the problem using the recursive solution?
A) 6
B) 13
C) 31
D) 63
E) 127

Question

Quizplus · Accepted Answer

The recursive solution for the Towers of Hanoi problem requires 2^n - 1 moves for n disks. For 6 disks, it would take 2^6 - 1 = 63 moves.

Recall the Towers of Hanoi Recursive Solution for This Problem