Question

Define tower of hanoi problem as a recurrence relation problem and solve it through a recurrence tree.

Answer 1

The French mathematicians will invent tower of Hanoi puzzle in an Edouard Lucas in 1883. The time beginning there is a time from the given poles to the stack with a 64 gold disk and also with smaller to on beneath.

The moves will be required for the tower within 64 disks at 264−1=18,446,744,073,709,551,615. And the rate will move per one second where it is nearly 584,942,417,355 years! To clear more puzzles.

• First of all, move a tower at a certain height-1 to an immediate pole by using the final pole.
• The tower at certain height-1 will be an immediate pole by using the original pole.
• Later remaining disk to a final pole.