In Tower of Hanoi, you have three pegs, one of which starts with a pile of disks on it, each of a different size. The disks are arranged on the peg with largest to smallest going from bottom to top.
Your task is to move all the disks from the original peg to the third peg. You may only move one disk at a time, and you may not place any disk on top of another disk that is smaller than it.
To use this applet to solve the puzzle, decide on a number of pegs and type it into the Number of pegs box. Then hit the Solve button. If you pick a large number, say 10, instructions generated by the program may take up so much memory that the applet may stop before it is finished.