|
Tool:
Tower of Hanoi |
Screenshot:
|
| Go to: |
http://www.cut-the-knot.org/recurrence/hanoi.shtml
(opens a new window)
|
| Description: |
Solve the Tower of Hanoi problem with different levels and see an explanation of the recursion relationship involved. |
| Technology Type: |
Java Applet | |
| Author: |
Alexander Bogomolny |
| Language: |
English | |
| Cost: |
Does not require payment for use |
|
| Average Rating: |
 [1]
|
Login to rate this resource
|
| My MathTools: |
Login to Subscribe / Save This
|
| Reviews: |
be the first to review this resource
|
| Discussions: |
start a discussion of this resource
|
|
| Courses: |
Math 6 |
Patterns and sequences |
| Math 7 |
Writing powers |
| Discrete Math |
Recurrence relations, Recurs. def. sequences, The towers of Hanoi |
|
|
Draco18s |
| Comment: | It shows the principle of Hanoi's Tower, but the applet itself is a little slow to respond to mouse-clicks, so patience is required. |
|