perplexus.info :: Algorithms : Towers of Hanoi

Towers of Hanoi (Posted on 2003-09-07)

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
Puzzle Thoughts	K Sengupta	2024-03-15 00:06:22
No Subject	Arjun	2007-09-08 12:20:37
re: A non-recursive solution	Xen	2004-05-25 16:17:04
re(2): Stacks--Basic version	Charlie	2003-09-09 14:14:52
re: Stacks--Basic version	Charlie	2003-09-09 14:07:51
Parity	Brian Smith	2003-09-09 10:06:49
Stacks	DJ	2003-09-08 13:28:35
A non-recursive solution	Federico Kereki	2003-09-08 13:18:33
C++ function	DJ	2003-09-08 12:29:22
follow this order	Ryan	2003-09-08 02:28:36
You blew it, Lewis !!!!!	Dan	2003-09-08 01:22:33
re: Recursion challenge	Charlie	2003-09-07 16:12:32
re(2): strategy	Charlie	2003-09-07 15:48:01
re: solution in 11 moves with 5 poles	Gamer	2003-09-07 15:40:06
solution in 19 moves	Victor Zapana	2003-09-07 15:13:01
Recursion challenge	Gamer	2003-09-07 14:19:04
re: strategy	Gamer	2003-09-07 14:15:48
strategy	Charlie	2003-09-07 11:23:12
re: Holy Hula Hoops!	Charlie	2003-09-07 11:14:04
Steps to follow (not for the impatient)	Jun	2003-09-07 10:41:04
Number of moves	Jill	2003-09-07 10:35:31
Holy Hula Hoops!	Eric	2003-09-07 10:12:37

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:


perplexus dot info