Details

Autor(en) / Beteiligte

• Fuwan Ren
• Qifan Yang
• Jiexin Zheng
• Hui Yan

Titel

Non-recursive Algorithm of Tower of Hanoi Problem

Ist Teil von

• 2010 10th IEEE International Conference on Computer and Information Technology, 2010, p.2134-2137

Ort / Verlag

IEEE

Erscheinungsjahr

2010

Quelle

IEEE Xplore

Beschreibungen/Notizen

• 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.