Abstract
An iterative solution to the generalized Towers of Hanoi problem, and its derivation are presented. In this generalization, one or more towers, consisting of a total ofn discs, are given as an initial legal configuration, and the task is to move them to a specified peg under the usual restrictions. An analysis of the iterative algorithm is also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. D. Atkinson,The cyclic Towers of Hanoi, Information Processing Letters 13 (1981), 118–119.
P. Buneman and L. Levy,The Towers of Hanoi problem, Information Processing Letters 10 (1980), 243–244.
E. W. Dijkstra,A Short Introduction to the Art of Programming, EWD316 (1971).
R. G. Dromey,How to Solve it by Computer, Prentice-Hall, London, (1982).
M. C. Er,The generalized Towers of Hanoi problem, Information Processing Letters (in press).
M. C. Er,A representation approach to the Tower of Hanoi problem, Computer Journal 25 (1982), 442–447.
P. J. Hayes,A note on the Towers of Hanoi problem, Computer Journal 20 (1977), 282–285.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Er, M.C. An iterative solution to the generalized Towers of Hanoi problem. BIT 23, 295–302 (1983). https://doi.org/10.1007/BF01934458
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01934458