edited by
669 views
3 votes
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

  1. $2n - n$
  2. $2n - 2n$
  3. $2n - n2$
  4. $2n - 1$
edited by

1 Answer

Best answer
3 votes
3 votes

All the options are incorrect , and it seems like Option D is misprinted that is instead of 2n-1, they have printed 2n - 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 2n - 1

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

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

4                    15(with restriction)

                      7(without restriction)

Update: Options have now been corrected.

edited by
Answer:

Related questions

0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
1,637 views
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest f...
1 votes
1 votes
3 answers
3
0 votes
0 votes
0 answers
4