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?
(In reply to
Hanoi by Bruce Brantley)
Holy cow! I Didn't read the title and posted before giving the puzzle more than a single thought. My previous response of "The title of the puzzle" must have helped some of you.
Soon I will reveal the title of CC3.
re: Hanoi
