The Tower of Hanoi problem is a classic example of a problem that can be…

Bihar STET · PGT (Paper 2) · Computer Science · 2025

The Tower of Hanoi problem is a classic example of a problem that can be solved using recursion. How many minimum moves are required to solve the Tower of Hanoi problem with 3 disks?

  1. A.

    3

  2. B.

    7

  3. C.

    15

  4. D.

    63

Attempted by 62 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science

Loading lesson…