    0

# The least number of moves in tower of hanoi puzzle with 10 discs?

Updated: 10/5/2023 Wiki User

13y ago

There is a formula for calculating the number of moves. The formula is 2^n-1. This means that to move one disk the number of moves can be calculated as 2^1-1. For two disks the calculation is 2^2-1.

Using this formula the answer 1023 can be found Wiki User

12y ago   Wiki User

13y ago

to find the lowest number of discs, take 2n-1 where n is the number of discs.

in simpler terms multiply 2 by itself for each disk, so for 4 discs you take 2*2*2*2, which equals 16, and subtract one, 15.   Wiki User

13y ago

The formula to find how many moves that are needed to complete the puzzle is 2(D)+(-1) where D is the number of disks. For example, if there are 6 disks, the equation is 2 to the 6th power minus 1 which equals 64-1, or 63

Tower of Hanoi# of DISKS and moves needed 3=7 4=15 5=31 6=63 7=127 8=255 9=511 10=1023 I Hope this helps you =)   Wiki User

13y ago

A tower of hanoi with 10 discs could be solved in 1023 moves

See the related link for a step by step 7 disc solution with 127 moves   Wiki User

11y ago

18,763,829,726,930,263,374   Wiki User

11y ago

18,948,387,374,746,172,084   Earn +20 pts  