Non-recursive Algorithm of Tower of Hanoi Problem

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.