Question discussion

What is the minimum number of moves needed to solve the Tower of Hanoi puzzle with 6 disks?

1705Medium DSSSB TGT Computer Science 0 replies

What is the minimum number of moves needed to solve the Tower of Hanoi puzzle with 6 disks?

  • A31
  • B127
  • C64
  • D63
Correct answer: D

Explanation

The minimum number of moves for n disks is 2ⁿ − 1, so for 6 disks it is 63.

Discussion 0

Nobody has replied yet. Start the discussion!