According to that algorithm, this article puts forward a formula to calculate the number of movements necessary for the 4-peg HanoiTowerproblem, and proves it using mathematical induction.
本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式,并用数学归纳法证明了它。
2
Tower of Hanoi is a typical problem that can only be solved using recursive method.
汉诺塔问题是典型的只有用递归方法才能解决的问题。
3
Tower of Hanoiproblem: There are three pillars ABC, A column has n different sizes of plates, the broader market in the next, small cap on.