he towers of hanoi was a ancient story of 3 towers and 64 rings in beginning all 64 disk are on one tower. the goal is to move all disk to one of the other towers, using the third tower as a spare. there are two strict rules
1. only one disk may be moved at a time
2. a larger disk may never be placed on top of a smaller disk

type in towers of hanoi game in google and play then play this alice program and watch it solve the puzzle
this puzzle only has 20 disk but still takes forever to complete
it took me about 15 minutes to make i might not update it it was just for fun and wanted to share
i know i can make it alot better (time ending at end of program and not keep running) but see what you think