Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem (Q1071509)

A theorem concerning the relation between the Towers of Hanoi and the binary numbers is proven in this paper. From this theorem, an algorithm for the Towers of Hanoi problem follows. The performance evaluations of all existing recursive and iterative algorithms for the Towers of Hanoi problem show that the above iterative algorithm is the most efficient one in terms of time and space. Finally, it is shown that the binary representation of numbers completely characterizes the status of all n discs in each step.