Bikram sir please correct it that answer is D) and no of moves required is 2^{n} -1 by mistakenly it was written 2n-1.

Dark Mode

460 views

3 votes

In Tower of Hanoi problem if the condition that A larger disk can not be kept on a smaller disk is removed, then the number of moves required to move $n$ disks

- $2n - n$
- $2n - 2n$
- $2n - n2$
- $2n - 1$

3 votes

Best answer

All the options are incorrect , and it seems like Option D is misprinted that is instead of **2n-1**, they have printed 2^{n} - 1.

The correct answer should be 2n-1, because since the restriction has been removed (that is we can place big disk over small disk) the number of disk movement will be reduced.

**No of Disk ** **No. of movements **

3 7(with restriction) i.e 2^{n} - 1

5 (without restriction) i.e 2n-1

--------------------------------------------------

4 15(with restriction)

7(without restriction)

Update: Options have now been corrected.

The original Tower of Hanoi problem has an condition/restriction that big disk can't be placed over small disk. So, the no of disk movement will be more,2^{n}-1 disk movements exactly.

But in this question, they have asked to calculate disk movement in tower of hanoi problem **without the above mentioned condition/restriction. **

So the answer for this 2n-1 disk movements.

0