This is my version of the tower of hanoi puzzle. I was inspired by this project by daeheryn: http://scratch.mit.edu/projects/daeheryn/26800 This has horrible graphics in comparision, but I made it so that it can solve itself. just press the "Auto-Solve" button. The rules are this: Try to move the tower to one of the other pegs in as few moves as possible You can only move the top disk in a stack You can not put a disk on a smaller disk
