HANOI TOWERS GAME HISTOTY HOW TO

One can also find a few places with TH in the multimedia Shockware (3 to 7 disks):Ĭartoon (part of an ad for a CD) - it may take some time initially to figure outĪnd at least three places are using the CGI script approach: The puzzle for up to 50 discs by 10 pegs graphically Robert Swartz: Towers of Chicago - solves.Rodin Enchev (check his new Version 2 - 3 towers on 6 pegs 3 color variation of TH!).One can also find there a long list of related references. It uses a nonrecursive algorithm for the automatic solution this is actually a multipeg version of the TH alowing up to 30 pegsĪnd can handle up to 500 disks.

includes detailed discussion of several TH algorithms and their relations! However, most of the online TH puzzles are written in Java, which allows moreįlexibility than JavaScript (even so, many of them can handle only small numbers of disks. Then there is a nice Internet Explorer ActiveX version:

Jasper van Zandbeek, Swedish version - 'disks'Īre represented by text strings the original was at.

HANOI TOWERS GAME HISTOTY HOW TO

The only one that knows how to start from an arbitrary disk configuration! In February 1998, and occassionally updated since then.įirst, a few other people also used JavaScript for online TH, for mostly up to 10 disks: This list of pages and sites related to the Tower of Hanoi was started (TH history, my JavaScript TH puzzles, TH algorithms) What can be found on the Web:

Hanoi towers game histoty