New Additions by Visitors
Submit new contributions here
Recursive Algorithm in 8088 Assembler and Excel VBA - Long ago, I implemented the Hanoi recursive algorithm directly in 6800uP machine language. I had two motivations: first, the recursive solution is very simple and required less coding and second, I was sick of all the buzz about "recursive languages" and how "magic" they were. Recently, I was teaching Excel VBA to a group of students and thought it would be fun to implement the Hanoi algorithm and use Excel graphics to show the "disks". I went on and thought why not relive the experience, but this time, with a modern PC type computer with display, keyboard and "debug.com" as the "assembler".
      Sergio Otaņo, guialtsen at hotmail . com, 2008/2/1
asynchronous speeds up execution - Unfortunately, my brain does not shut off some times and it realised (while I was trying to sleep) that there was no real reason for only one ring to move at a time, so I was compelled to create this version (abstracting on the Hanoi.lua class) that has parallel threads attempting to complete the task. OK, not really compelling reason for multi-core chips, but one does what one can for the industry.
Again, this version runs on Lua, and requires VoodooPad, thus Mac OS X.
I will shortly provide a version of these that uses the Tk bindings that I believe are avialable with Lua.

      Damon Permezel, hanoi at damon . com, 2007/2/11
Towers of Hanoi for VoodooPad Lua - VoodooPad has a Lua-based extension language. Accordingly, I have just learned Lua. Accordingly, I have written ToH in Lua to be run in VoodooPad. A demo version of VoodooPad is available. All you need is a Mac! Come on, you want one. Here's a good excuse to go out and get one.
VoodooPad (I have no interest, pecuniary or otherwise) can be obtained at http://www.flyingmeat.com/.
Lua rocks!
VoodooPad is pretty cool too.
      Damon Permezel, hanoi at damon . com, 2007/2/9
Towers of Hanoi in Tk/Tcl - I released this to the net in 1993. I recently recaptured it, and fixed a bug that prevented it working on Mac OS X, and hereby re-submit it for your entertainment. It was my first Tk programme. The rather horrible 'menu' selector at the top allows running it, but it also has key bindings that you can use instead. The 'degree of frenzy' is quite useful if you get bored. Please submit any bugs to user 'hanoi' who resides electronically at the host whose name is the same except for the 'www.' and I will endeavour to fix them. Enjoy!
      Damon Permezel, hanoi at damon . com, 2007/2/8
Multi-Peg Towers of Hanoi - My Multi-Peg Towers of Hanoi Applet is back on the web. It handles between 3 and 50 pegs, and between 3 and 200 disks. For a given number of pegs and disks, it can choose between different presumed optimal solutions.
      Robert J. Swartz, robert at mathapplets . net, 2006/11/20
Towers of Hanoi - A Flash version of the popular Towers of Hanoi game. Features up to eight disks.
      ewhitgames.com, ewhitmire at fuse . net, 2006/8/26
Open-Sea Master - tell to the visitors that :for each disk they add the nunber of movemment will : double + 1. this is easy to chek using feew disks.I'm not a math but I note that the three disks on top remains rotating in the same as clokwising (if they can be divided by two w/out rest)and contrary way ,if not. up to the end,when they go to the last 3 positions in the 3rd pin.The disks under they go to the contrary way alternating the time to play. Never mind the disk number ,the procedure will be the same.You must know the number of movemment before start the game.this is necessary to determine the initial movemment.To knows the number of movemment use the math formula M= (2^d)-1 for exemple: number of disk=5 Movemments = 32-1 = 31 Good time of intertainment !!
      Jorge Garcia Terra, masterra at . yahoo.com.br, 2006/7/15
Logic Puzzle Museum - Describes the Logic Puzzle Museum that is a hands-on mechanical & brain puzzle museum with more than 50 diferent puzzles to try including the Tower of Hanoi puzzles. Several vintage versions TH puzzles are in the exhibits. It is a small, non-profit, educational museum, not government funded, but offered and run by volunteers and the puzzle collector. Special events on website, too.
      Judith Schulz, logicpuzzles1 at hotmail . com, 2006/4/23
New algorithm - This came on 19/05/2005 from jd_hsu at yahoo . com:
I believe I have an algorithm to solve that puzzle about twice as fast as the iterative one you present on your site. I am still implementing it at the moment. Let me know if you are interested in it.
Jean-David Hsu

Yes, I am. Please submit more details. Your e-mail address doesn't work.

      mk

Educational Tower of Hanoi PC Software - Malatog Software have developed a commercial PC computer version of the Tower of Hanoi puzzle - mainly aimed at the educational market. The software has good graphics/sounds, etc. and the full version can handle up to 20 discs from any source picket to any destination picket. The educational version is unique in that it allows tutors to set up 'lessons' that (amongst other things) can be used to restrict the features of the software and therefore focus a student's attention on a specific study area of the puzzle. This is probably the best PC version available and is a valuable teaching resource to the educational market. There is also a free demo version to download from the site.
      Malatog Software, hanoi at malatog . co.uk, 2005/3/2
Tower Of Hanoi using Java 3D - Java applet using Java 3D.
      Jürgen Failenschmid, jfai at pacbell . net, 2004/9/22
http://www.simtel.net/pub/pd/68609.html - tower of hanoi in 3d for windows written with directx9.
      2004/8/28
An optimal solution An optimal solution to the Towers of Hanoi - A constant space complexity solution for a generalization of the Tower of Hanoi problem is described. This generalization allows arbitrary initial and final disk configurations. The number of movements achieved is the minimum possible. Some aspects about the mathematical-computational relation of the problem are briefly discused and an informal demonstration of the proposed algorithm correctness and optimality is presented. Applet included.
      Carlos Rueda, carueda at ucdavis . edu, 2004/2/20
Multi-Peg Tower of Hanoi Applet - This is a brand new version of my multi-peg applet. It handles up to 50 pegs and 200 disks.
      Robert J. Swartz, mathguy at prodigy . net, 2002/7/7
Java Applets for Data Structures and Algorithms - The website contains a set of Java Applets to demonstrate the working of recursive algorithms (including the Tower of Hanoi), and various operations on data structures.
      R.Mukundan, mukund at cosc . canterbury . ac . nz, 2002/5/9
Jaap's Puzzle Pages - This page has a detailed description of some of the theory of these puzzles, including how to solve it from any position. There is a script that can play (and solve) a tower of up to 9 disks, with an editing feature. The rest of the site is mostly about Rubik-like puzzles.
      Jaap Scherphuis, jaapsch at yahoo . com, 2002/3/22
Puremass Tower of Hanoi Puzzle analysis - Recursion is faster after all than the "fast" non-recursive algorithms?
This analysis comes to the conclusion that the recursive program is the only practical solution for very large Tower of Hanoi puzzles!
(However, the recursive program uses more memory, and it cannot start from any move without having to calculate all the previous ones.)
      2002/3/22