Peer Review for material titled "Towers of Hanoi"
User Rating for material titled "Towers of Hanoi"
Member Comments for material titled "Towers of Hanoi"
Bookmark Collections for material titled "Towers of Hanoi"
Course ePortfolios for material titled "Towers of Hanoi"
Learning Exercises for material titled "Towers of Hanoi"
Accessibility Info for material titled "Towers of Hanoi"
Please enter a Bookmark title
Please limit Bookmark title to 65 characters
Please enter a description
Please limit Bookmark title to 4000 characters
A Bookmark with this title already existed.
Please limit a note about this material to 2048 characters
Search all MERLOT
Select to go to your profile
Select to go to your workspace
Select to go to your Dashboard Report
Select to go to your Content Builder
Select to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II

Advanced Search



        

Search > Material Results >

Towers of Hanoi

        

Towers of Hanoi

Logo for Towers of Hanoi
A very good implementation of the classic Towers of Hanoi problem. Teaches recursive functions and stacks as well as recurrence relations.
Material Type: Learning Material
Date Added to MERLOT: September 02, 1997
Date Modified in MERLOT: May 13, 2015
Author:
Send email to alexb@cut-the-knot.com

Quality


  • Rate this material
  • Create a learning exercise
  • Add accessibility information
  • Pick a Bookmark Collection or Course ePortfolio to put this material in or scroll to the bottom to create a new Bookmark Collection
    Name the Bookmark Collection to represent the materials you will add
    Describe the Bookmark Collection so other MERLOT users will know what it contains and if it has value for their work or teaching. Other users can copy your Bookmark Collection to their own profile and modify it to save time
    Edit the information about the material in this {0}
    Submitting Bookmarks...

About

Primary Audience:
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: no
Accessiblity Information Available: no
Creative Commons: unsure

Connections





QR Code for this Page

Users who viewed this material also viewed...

Discussion

Discussion for Towers of Hanoi

Log in to participate in the discussions or Sign up if you are not already a MERLOT member.

Return to Top of Page
Avatar for Isabel Azevedo
4 years ago

Isabel Azevedo (Faculty)

Very interesting


Avatar for Audrone Matutis
8 years ago

Audrone Matutis (Faculty)

A great visual aid for teaching how to develop an algorithm to programatically solve this classic recursive function problem.

Technical Remarks:

The page has been moved. It's new location is: www.cut-the-knot.org/recurrence/hanoi.shtml

Avatar for Audrone Matutis
9 years ago

Audrone Matutis (Faculty)

A good visual tool for teaching how to solve a classic programming problem. Segues nicely into material for dissecting the problem, developing a solution algorithm and then writing the resulting function.

Discussing the mathematical formula for determining the minimum number of moves
needed to solve the puzzle with any number of disks, makes this a good example of what programmers need to consider in order to develop efficiently running programs.

Technical Remarks:

Sometimes the applet controls were only partly visible after loading. This is easily resolved by refreshing the display.
Used in course

Avatar for L Collins
11 years ago

L Collins (Student)

I played the game 10 times, and came up with increasingly better resluts.
(Scores were 32,29,23,19,21,17,19,17,17,15.) I was stuck at 17 moves, and then
watched the animation a few times. After that I was able to get down to 15
moves. I thought this game was fun and I appreciated the feedback, and also the
animation. This would be a good teaching tool for K-8 students.
Used in course