How to solve tower of hanoi puzzle
Answers
Answered by
0
Answer:
With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.
...
For example, in an 8-disk Hanoi:
Move 0 = 00000000. The largest disk is 0, so it is on the left (initial) peg. ...
Move 28 − 1 = 11111111. ...
Move 21610 = 11011000.
Similar questions