An iterative algorithm for the cyclic Towers of Hanoi problem
- Cite this article as:
- Er, M.C. International Journal of Computer and Information Sciences (1984) 13: 123. doi:10.1007/BF00978713
- 142 Downloads
In the cyclic Towers of Hanoi problem, the discs may only move in a clockwise direction from a source peg to a specified peg subject to the usual restrictions of the standard problem. An iterative solution to the modified problem is presented. A number of observations that lead to the construction of an iterative algorithm is also discussed.