This is a web page which animates the solution to the Tower of Hanoi problem. The user inputs the number of disks they would like to start with, and the tower is constructed then solved on the webpage.
tpsatt/hanoi
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|