Tower of Hanoi algorithm
The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, and then making a conical shape. Try to move all the disks onto another pole. Thing is, you can only move one disk at a time and you must follow size order (a bigger disk can't go on a smaller disk). Good luck! Free JavaScripts
provided
by The JavaScript Source From 'Tower of Hanoi algorithm' to home From 'Tower of Hanoi algorithm' to 'Fun menu'
|
