just press start the puzzle towers of hanoi is solved step by step. for 10 disks, it needs 2^10-1 =1023 steps, which lasts ca. 17 minutes at 1 second / step.
the puzzle towers of hanoi consists of m disks of decreasing size. there are three needles to navigate. at the beginning, all disks are stacked on the left needle. the objective of the game is to bring this tower of disks to the right needle, where it is only permissible to place a smaller disk on a bigger one. the legend goes, that in hanoi there is a puzzle with 64 disks and the monks are operating one disk per second. if the tower is moved, the world will end. this will be in approx. 5.85 * 10^11 years.
