An iterative algorithm for the cyclic Towers of Hanoi problem |
| |
| Authors: | M. C. Er |
| |
| Affiliation: | (1) Department of Computing Science, University of Wollongong, P.O. Box 2500, 2500 Wollongong, N.S.W., Australia |
| |
| Abstract: | 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. |
| |
| Keywords: | Towers of Hanoi iteration recursion algorithm design |
| 本文献已被 SpringerLink 等数据库收录！ |
|
