|
|
Tower of Hanoi (TH) on the Web
|
|
|---|
Please, better start here
(TH history, my JavaScript TH puzzles, TH algorithms)
What can be found on the Web:
This list of pages and sites related to the Tower of Hanoi was started
in February 1998, and occassionally updated since then.
Newer
additions are here (please contribute).
First, a few other people also used JavaScript for online TH, for mostly up to 10 disks:
Then there is a nice Internet Explorer ActiveX version:
However, most of the online TH puzzles are written in Java, which allows more
flexibility than JavaScript (even so, many of them can handle only small numbers of disks -
few go beyond 8 disks):
- Apostolos Syropoulos
- includes detailed discussion of several TH algorithms and their relations!
- Kong-Kat Wong -
a modified version here
- Mark Donnermeyer: http://www.swt.ruhr-uni-bochum.de/hanoi/Spiel.html
- Xue-Miao Lu
- this is actually a multipeg version of the TH alowing up to 30 pegs
and can handle up to 500 disks. It uses a nonrecursive algorithm for the automatic solution
of the multipeg problem. One can also find there a long list of related references.
- Fwu-Shan Shieh: http://www.eng.auburn.edu/~fwushan/Hanoi1.html
- Xu Dien: http://www.vietinfo.com/kle/java/hanoi/
- Alexander Bogomolny
- John J. Wills
- Roger Zeitel: http://playground.idtv/speel/hanoi-2.htm
- Rodin Enchev (check his new Version 2 - 3 towers on 6 pegs 3 color variation of TH!)
- Peter Haensgen: http://www.rz.tu-ilmenau.de/~haensgen/hanoi/hanoi.html
- Kang Sun: http://www.astro.yale.edu/sun/ihanoi/
- Robert Swartz: Towers of Chicago - solves
the puzzle for up to 50 discs by 10 pegs graphically
One can also find a few places with TH in the multimedia Shockware (3 to 7 disks):
- http://www.exmachina.be/galaxians/gb/games/hanoy.html - Galaxians - TH as a
cartoon (part of an ad for a CD) - it may take some time initially to figure out
which part of the scene is the TH
- The Tower of Brahma
- http://www.gis.net/~bongwook/toh.html - Bong-wook Lee - "disks"
created by slicing a classical statue
And at least three places are using the CGI script approach:
- William Kendrick
- Death of 'Net Predictor was at http://adobe.chaco.com/~glenn/hanoi/
and http://www.netmud.com/~glenn/hanoi/ - this
TH game is for those 64 legendary golden disks, and the moves are initiated
by the visitors to this page! When the game is completed, the Internet will meet its death
in accordance with the TH legend!
- Philip Spencer
(up to 10 disks)
Using ML, it is possible to write the TH puzzle in plain HTML:
A 3D version of the same can be realized in VRML:
Or animated GIFs are used to demonstrate the solution:
On the Web there are also many TH codes that are not online:
- Short, "mysterious" TH code (C)
- TH test code is contained in the Miracle C Compiler package
- Albert Israel
- demonstration of the recursive capabilities of Fortran 90
- http://www.fortran.com/walt/imagine1/ex_hanoi.html, Unicomp, Inc
- the same for the F language, which is a subset of Fortran 90
- Damon Anton Permezel - TH in LISP (Emacs)
(was at http://www.ccd.bnl.gov/pub/IRIX/xemacs-19.12/lib/xemacs-19.12/lisp/games/hanoi.el,
compiled: http://www.ccd.bnl.gov/pub/IRIX/xemacs-19.14.IRIX-6.2/lib/xemacs-19.14/lisp/games/hanoi.elc,
?: http://ftp.sunet.se/ftp/pub/lang/tcl/alcatel/code/annoy.README)
- Classic recursive and an iterative solution in Scheme (a LISP dialog)
- Mark Janeba
- TH code for the Ti-82 and Ti-85 Graphics Calculators
- John Beidler - an ADA program
- http://www.scranton.com/~bschnell/code.html, Robert McCloskey - a different ADA program
from the same University of Scranton as the previous one
- http://www.esiee.fr/infoweb/labos/Kits/ManFischer00.html#6.6", FischerTechnik -
commands (C code) to instruct the FischerTechnik robots how to play the TH!
- http://www.cs.vu.nl/~tmgil/vi/vimacros/hanoi, Greg McFarlane -
the Hanoi solving macros for the Unix vi editor
- Kai Nikulainen - TH on
Reqtools requesters for AMIGA
- Recursive HT in two shell scripting
languages (tf, bash)
- http://www.cdrom.com/pub/ada/userdocs/html/cardcat/vdt100.html, TH code as a test
program for a VT100 terminal package
- Arlet Ottens
and Chris Cole both
include the same code written by a Sharma in bc (the Unix arbitrary precision arithmetics langauage) for
finding the minimal-move solution of the four peg variation of the TH puzzle
You can also
or make your own cardboard TH puzzle from the browser printout:
TH is a favourite assignment for the recursive-function section of the
computer science courses:
- http://mathcs.rhodes.edu/~stuart/labs/lab8/node4.html, Brian L. Stuart -
from his page I borrowed the wording of the legend at the top of this page
- http://www.cs.geneseo.edu/users/faculty/baldwin/csci141-s96/towers.html">Doug Baldwin's assignment
- nice pictures of the towers
- another variation of the above legend placing the monks in Hanoi
- proof that no other algorithm can result in less moves
- Eric W. Weisstein
- more references, relation between the TH puzzle solution and the Hamiltonian path in a hypercube
- John Beidler
Ou des courses informatiques:
- http://www-igm.univ-mlv.fr/~foucou/3W/Hanoi/ - Pierre-Yves Foucou
An item on the TH can be found in an online mathematics encyclopedia:
And several more in the
Graph of all possible positions (with lines connecting two positions that differ by a single move) will the more approximate the fractal triangular shape of Sierpinski's gasket, the more disks:
Another one discusses the relation between the Hamiltonian path
that visits exactly once every corner of a hypercube and the winning strategy in the puzzle of TH
One can download several TH papers including an extensive (over 200 references) scholarly
TH bibliography by
TH can also be found among the high school projects:
- http://rialto.k12.ca.us/school/frisbie/mathfair/hanoi.html, Olga Pesantes, Frisbie Middle School, CA
- Paul Eubanks, Washington High School, Chicago
TH in a Course on Thinking psychology:
- http://nersp.nerdc.ufl.edu/~sbless/exp4635/tohproduct.html, Stephen Blessing
TH used as benchmarks of the recursive function capabilities:
- http://www.stic.org/BnchMark/D010.HTM, Smalltalk/C,C++ comparison
- http://www8.zdnet.com/pcmag/features/pctech/1518/java07.htm, Benchmark for Java
Also my own nonrecursive
into a benchmarking exercise in a sense.
Finally, there are humorous "other" solutions to the TH puzzle:
- Loïc Prylli - contemplative,
preservative, normative, laxative, and interactive (the last one will lead you as far as the above mentioned Death of 'Net Predictor)
Contribute new pages, new locations, corrections here
