Pages • 1
Towers of Hanoi Code Join now to read essay Towers of Hanoi Code This applet solves the Towers of Hanoi problem for a tower of 10 disks. (Ten differntly-sized disks are stacked in a pile, in order of decreasing size. There are two other places for piles. The object is to move the pile to.