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

 Towers of Hanoi variation (Posted on 2005-05-03)
There are some poles, and on the first pole are some rings, each a different size. The sizes of the rings increases from the top to the bottom of the pole. The only allowable move is to take the top ring from any pole and place onto another pole. You cannot place a ring on top of another ring unless the other ring is exactly one size bigger. You can make as many moves as you like.

Your goal is to move all the rings onto the second pole, in the same order. What is the highest number of rings that can be moved when there are N poles? How can you move this many rings?

 See The Solution Submitted by Tristan Rating: 4.0000 (4 votes)

 Subject Author Date No Subject Arjun 2007-09-08 12:14:11 my solution (someone back me up) cecil tucker 2005-06-30 04:39:42 Addition Jurgen 2005-05-05 18:58:12 No Subject Jurgen 2005-05-05 18:22:31 re(3): solution (I think) Avin 2005-05-03 19:43:48 re(2): solution (I think) Erik O. 2005-05-03 18:20:50 Solution Leming 2005-05-03 18:20:21 re: solution (I think) Jer 2005-05-03 17:53:32 Movement algorithm - spoiler? Erik O. 2005-05-03 17:53:06 re: Hanoi Bruce Brantley 2005-05-03 17:24:13 Hanoi Bruce Brantley 2005-05-03 17:07:48 On second thought... Jer 2005-05-03 17:05:25 Is this problem asking what you think? Jer 2005-05-03 17:02:45 solution (I think) Erik O. 2005-05-03 15:00:31

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: