In a game, there are 3 stands A,B and C in which a rod is placed in the middle of each stand and stand A consists of 8 rings of different diameters,You are to transfer all the rings from stand A to either stand B or stand C with minimun number of moves using the following rules:
1. Only move one ring at a time
2. A larger ring must never be on top of a smaller ring at any time.
How many moves are needed when stand A consist of
1. 2 rings?
2. 5 rings?
3. n rings?
Maths~!
2007-08-12 9:50 pm
回答 (1)
2007-08-12 10:14 pm
✔ 最佳答案
This is the famous mathematical game "Tower of Hanoi"For a given number of rings, the number of moves = (2^n) -1
1. (2^2) - 1 = 3
2. (2^5) - 1= 31
3. (2^n) -1
You may refer to the website below. =)
收錄日期: 2021-04-26 15:00:12
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20070812000051KK02063