MERLOT Comments Search - material=74669&backPage=%0A%0A%0A%0A%2Fmaterials.htm%3Fcategory%3D2635%26
http://www.merlot.org:80/merlot/
A search of MERLOT commentsCopyright 1997-2015 MERLOT. All rights reserved.Thu, 29 Jan 2015 05:10:54 PSTThu, 29 Jan 2015 05:10:54 PSTMERLOT Comments Search - material=74669&backPage=%0A%0A%0A%0A%2Fmaterials.htm%3Fcategory%3D2635%26http://www.merlot.org:80/merlot/images/merlot.gif
http://www.merlot.org:80/merlot/
4434Comment for Towers of Hanoi from Isabel Azevedo
http://www.merlot.org/merlot/viewComment.htm?id=491470
Very interestingComment for Towers of Hanoi from Audrone Matutis
http://www.merlot.org/merlot/viewComment.htm?id=226520
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.shtmlComment for Towers of Hanoi from Audrone Matutis
http://www.merlot.org/merlot/viewComment.htm?id=95413
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.Comment for Towers of Hanoi from L Collins
http://www.merlot.org/merlot/viewComment.htm?id=94973
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.