Towers of Hanoi

[premshree]

The problem in Towers of Hanoi is to move all the disks from the first tower (leftmost) to the third tower (rightmost), subject to the condition that only one disk can be moved at a time, and that no disk is ever allowed to be placed on top of a smaller disk.

This JavaScript can list the instructions for obtaining the solution and also simulates the solution for any number of disks.

Check it out at :
http://www24.brinkster.com/premshree/towers-of-hanoi/index.htm

OR

http://www.qiksearch.com/javascripts/towers-of-hanoi/index.htm

OR see attachment below.

:thumbsup:

[A1ien51]

Page isn't there:( :( :( :eek:

[premshree]

There seems to be some problem with the page.
See the attachment or see :

http://www.qiksearch.com/javascripts/towers-of-hanoi/index.htm