International Journal of Computer & Information Sciences

, Volume 13, Issue 2, pp 123-129

First online:

An iterative algorithm for the cyclic Towers of Hanoi problem

  • M. C. ErAffiliated withDepartment of Computing Science, University of Wollongong

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

Key words

Towers of Hanoi iteration recursion algorithm design