Help on query formulation
Study of the Hanoi Tower problem with multi-pegs. (Chinese)
Acta Sci. Nat. Univ. Pekin. 42, No. 1, 99-102 (2006).
Summary: The authors investigate the Hanoi Tower problem with multi-pegs more than three. Based on the idea of dynamic programming, the recursion formula of the least number of movements necessary for this problem is presented. The direct formula of the least number of movements necessary for this problem is given and proved by triple mathematical induction and pure combinatorics.
Classification: K20
Valid XHTML 1.0 Transitional Valid CSS!