| Tool: Towers of Hanoi |
Screenshot: 
|
||
| Go to: | http://nlvm.usu.edu/en/nav/frames_asid_118_g_3_t_2.html (opens a new window) | ||
| Description: | Solve the tower problem and test your theory by varying the number of disks. | ||
| Technology Type: | Java Applet | ||
| Guide: | User's Guide (opens a new window) | ||
| Author: | National Library of Virtual Manipulatives (Utah State University) | ||
| Language: | English | ||
| Cost: | Does not require payment for use | ||
| Average Rating: |
 [3]
|
Login to rate this resource | |
| My MathTools: | Login to Subscribe / Save This | ||
| Reviews: | be the first to review this resource | ||
| Discussions: | see the 5 posts discussing this resource | ||
| Activity: | Tower of Hanoi | ||
| Support Materials: | Tower of Hanoi - Suggested Solution | Ask Dr. Math: FAQ: Tower of Hanoi | |
| Courses: | Math 3 | Patterns and sequences | |
| Math 4 | Patterns and sequences | ||
| Math 5 | Patterns and sequences | ||
| Math 6 | Patterns and sequences | ||
| Math 7 | Writing powers | ||
| Discrete Math | The towers of Hanoi | ||
|
| |||