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.
-
Notifications
You must be signed in to change notification settings - Fork 0
tpsatt/hanoi
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Tower of Hanoi solver which animates the solution.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published