According to that algorithm, this article puts forward a formula to calculate the number of movements necessary for the 4-peg Hanoi Tower problem, and proves it using mathematical induction.
本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式，并用数学归纳法证明了它。
According to that algorithm, this article puts forward a formula to calculate the number of movements necessary for the 4-peg Hanoi Tower problem, and proves it using mathematical induction.
本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式，并用数学归纳法证明了它。
应用推荐