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

Home > Algorithms
Towers of Hanoi (Posted on 2003-09-07) Difficulty: 3 of 5
You have three small poles and five hoops - XS, S, M, L, XL (as in extra small, small, medium, large and extra large). They are placed on pole 1 in order, with largest at the bottom.

You can move one hoop at a time, and the hoops you are not moving have to be on a pole. You also cannot place a hoop on top of a smaller one. How can you move the hoops so that they are in the same order as they are now, but on pole 3?

See The Solution Submitted by Lewis    
Rating: 3.0667 (15 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
No SubjectArjun2007-09-08 12:20:37
Some Thoughtsre: A non-recursive solutionXen2004-05-25 16:17:04
re(2): Stacks--Basic versionCharlie2003-09-09 14:14:52
re: Stacks--Basic versionCharlie2003-09-09 14:07:51
ParityBrian Smith2003-09-09 10:06:49
SolutionStacksDJ2003-09-08 13:28:35
SolutionA non-recursive solutionFederico Kereki2003-09-08 13:18:33
Some ThoughtsC++ functionDJ2003-09-08 12:29:22
follow this orderRyan2003-09-08 02:28:36
You blew it, Lewis !!!!!Dan2003-09-08 01:22:33
re: Recursion challengeCharlie2003-09-07 16:12:32
re(2): strategyCharlie2003-09-07 15:48:01
re: solution in 11 moves with 5 polesGamer2003-09-07 15:40:06
solution in 19 movesVictor Zapana2003-09-07 15:13:01
QuestionRecursion challengeGamer2003-09-07 14:19:04
re: strategyGamer2003-09-07 14:15:48
strategyCharlie2003-09-07 11:23:12
re: Holy Hula Hoops!Charlie2003-09-07 11:14:04
Steps to follow (not for the impatient)Jun2003-09-07 10:41:04
Number of movesJill2003-09-07 10:35:31
Holy Hula Hoops!Eric2003-09-07 10:12:37
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information