%0 Journal Article
%A LIU Duo
%A DAI Yiqi
%T Study of Hanoi Tower Problem with Multi-Pegs
%D 2006
%R
%J Acta Scientiarum Naturalium Universitatis Pekinensis
%P 99-102
%V 42
%N 1
%X 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.
%U https://xbna.pku.edu.cn/EN/abstract/article_1281.shtml