This is a QR code. A QR Code is a 2-dimensional barcode, which has encoded in it a URL (web address), text, or other information. It can be read by a QR code scanner, including QR scanner smartphone apps. Once you have an app installed on your smartphone, open the app and hold your phone’s camera over a QR code to read it. Most QR codes you’ll come across have a URL encoded, so chances are when you read the QR code it will take you to a web page.
Reviewed by members of Editorial board for inclusion in MERLOT.
Click to get more information on the MERLOT Editors' Choice Award in a new window.
Click to get more information on the MERLOT Classics Award in a new window.
Click to get more information on the MERLOT JOLT Award in a new window.
Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here 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


        

Material Detail


Towers of Hanoi

QR Code for this Page
Bookmark and Share
 
Location:
Material Type: Learning Material
Date Added to MERLOT: September 02, 1997
Date Modified in MERLOT: February 24, 2013
[Report Broken Link]    [Report as Inappropriate]

Author: Alexander Bogomolny Send email to Alexander Bogomolny 
Submitter : Scott J. Kleper

Description:
A very good implementation of the classic Towers of Hanoi problem. Teaches recursive functions and stacks as well as recurrence relations.

Browse in Categories:

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

About this material:



 

Discussion for Towers of Hanoi

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

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

Isabel Azevedo (Faculty)

Very interesting


Avatar for Audrone Matutis
7 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
8 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
10 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

Return to Top of Page