DocumentCode
2201915
Title
Non-recursive Algorithm of Tower of Hanoi Problem
Author
Ren, Fuwan ; Yang, Qifan ; Zheng, Jiexin ; Yan, Hui
Author_Institution
City Coll., Sch. of Comput. & Comput. Sci., Zhejiang Univ., Hangzhou, China
fYear
2010
fDate
June 29 2010-July 1 2010
Firstpage
2134
Lastpage
2137
Abstract
As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to top with integer. Considering the relationship between disks and pegs, we design a new non-recursive solution to determine which disk is moved and which peg will be move to in each step. The algorithm is relatively simple and efficientive. We also discuss the optimization which is with scalability under certain conditions.
Keywords
optimisation; recursive functions; Hanoi problem tower; nonrecursive algorithm; nonrecursive solution; Algorithm design and analysis; Complexity theory; Computers; Optimization; Poles and towers; Programming; Software algorithms; Tower of Hanoi; non-recursive; optimization; recursive; time complexity;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
Conference_Location
Bradford
Print_ISBN
978-1-4244-7547-6
Type
conf
DOI
10.1109/CIT.2010.364
Filename
5578370
Link To Document