All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Three of Hanoi (Posted on 2005-07-01) Difficulty: 3 of 5
  • When solving the Towers of Hanoi puzzle, it's easy to show that on every other turn you must move the smallest disk... can you do this?
  • Then again, can you also prove that the smallest disk will move cyclically -- for example, from post 1 to post 2 to post 3 to post 1, and so on?
  • Finally, using that fact, can you provide an iterative (that is, not recursive) algorithm for solving the puzzle?
  • See The Solution Submitted by Federico Kereki    
    Rating: 4.5000 (2 votes)

    Comments: ( You must be logged in to post comments.)
      Subject Author Date
    QuestionArjun2007-09-08 12:24:04
    My solutionJort Bloem2006-10-23 23:14:50
    SolutionOne good solution, one so-so solutione.g.2005-07-02 14:03:33
    Please log in:
    Login:
    Password:
    Remember me:
    Sign up! | Forgot password


    Search:
    Search body:
    Forums (0)
    Newest Problems
    Random Problem
    FAQ | About This Site
    Site Statistics
    New Comments (3)
    Unsolved Problems
    Top Rated Problems
    This month's top
    Most Commented On

    Chatterbox:
    Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information