Study of Hanoi Tower Problem with Multi-Pegs
Yiqi Dai · Beijing Daxue Xuebao. Zirankexueban · 2006
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.