Home » MCQs » Data Structure and Algorithms (DSA) MCQs

How many moves are required as minimum to solve the Tower of Hanoi problem?

24. How many moves are required as minimum to solve the Tower of Hanoi problem?

1. n
2. 2n
3. 2n-1
4. 2^n-1

Answer

The correct answer is: D) 2^n-1

Explanation

Considering n as the number of disks, 2ⁿ-1 are the minimum number of moves required to solve the Tower of Hanoi problem. For example, in the case of 3 disks, minimum 2³-1 = 7 moves are required to solve the Tower of Hanoi problem.