Disks in a tower of Hanoi are identified from top to bottom as 1, 2, 3, and so on. A computer can solve the puzzle by listing each disk moved, in order. For example, a 3-disk puzzle is solved as 1-2-1-3-1-2-1. If it takes a computer 1 second to display the 10-disc solution, how long would it take to display the solution to a 30 disc tower?

Question

Disks in a tower of Hanoi are identified from top to bottom as 1, 2, 3, and so on.  A computer can solve the puzzle by listing each disk moved, in order.  For example, a 3-disk puzzle is solved as 1-2-1-3-1-2-1.  If it takes a computer 1 second to display the 10-disc solution, how long would it take to display the solution to a 30 disc tower?

rizags · Answer

you getting anywhere on this one? it had me stumped trying to find an algorithm for the tower of hanoi