Tower of Hanoi with n disks requires how many moves?

Question

Accepted Answer

(C) 2^n - 1. Explanation: Tower of Hanoi always requires exactly 2^n - 1 moves. For n=3: 7 moves.