Press the green flag and enter the number of disks you want to use. The program will demonstrate how to solve the Tower of Hanoi problem (https://en.wikipedia.org/wiki/Tower_of_Hanoi). If you use <6 disks, you can see the problem being solved with rectangles
Remixed from https://scratch.mit.edu/projects/901523/
