Hello and welcome to our community! Is this your first visit?
Register
Enjoy an ad free experience by logging in. Not a member yet? Register.
Results 1 to 3 of 3

Thread: Towers of Hanoi

  1. #1
    Regular Coder
    Join Date
    Jun 2002
    Location
    Mumbai, India
    Posts
    218
    Thanks
    0
    Thanked 0 Times in 0 Posts

    Thumbs up Towers of Hanoi

    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...anoi/index.htm

    OR

    http://www.qiksearch.com/javascripts...anoi/index.htm

    OR see attachment below.

    Last edited by premshree; 09-23-2002 at 09:46 AM.

  • #2
    Senior Coder A1ien51's Avatar
    Join Date
    Jun 2002
    Location
    Between DC and Baltimore In a Cave
    Posts
    2,717
    Thanks
    1
    Thanked 94 Times in 88 Posts
    Page isn't there

  • #3
    Regular Coder
    Join Date
    Jun 2002
    Location
    Mumbai, India
    Posts
    218
    Thanks
    0
    Thanked 0 Times in 0 Posts
    There seems to be some problem with the page.
    See the attachment or see :

    http://www.qiksearch.com/javascripts...anoi/index.htm
    Attached Files Attached Files


  •  

    Posting Permissions

    • You may not post new threads
    • You may not post replies
    • You may not post attachments
    • You may not edit your posts
    •