Skip to main content
SpringerLink
Log in

Towers of Hanoi problems: Deriving iterative solutions by program transformations

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

A Correction to this article was published on 28 November 2019

This article has been updated

Abstract

We present the iterative solutions of the Towers of Hanoi problems (standard, cyclic, and generalized) using the program transformation methodology of Burstall-Darlington. We derive algorithms with minimal time × space requirements. Their correctness proofs are trivial, as usual when applying the program transformation technique.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Change history

  • 09 December 2019

    In the originally published version, the author found some subsequent corrections. It should read correct.

  • 28 November 2019

    In the originally published version, the author found some subsequent corrections. It should read correct.

References

  1. M. D. Atkinson,The cyclic Towers of Hanoi, Information Processing Letters 13 (1981), 118–119.

    Google Scholar 

  2. P. Buneman and L. Levy,The Towers of Hanoi problem, Information Processing Letters 10 (1980), 243–244.

    Google Scholar 

  3. R. M. Burstall and J. Darlington,A transformation system for developing recursive programs, J.A.C.M., Vol. 24, No. 1 (1977) 44–67.

    Google Scholar 

  4. E. W. Dijkstra,A short introduction to the art of programming, EWD316 (1971).

  5. M. C. Er,The generalized Towers of Hanoi problem, Private Communication.

  6. M. C. Er,An iterative solution to the generalized Towers of Hanoi problem, BIT 23 (1983), 295–302.

    Google Scholar 

  7. P. J. Hayes,A note on the Towers of Hanoi problem, Computer Journal 20 (1977), 282–285.

    Google Scholar 

  8. M. S. Paterson and C. E. Hewitt,Comparative schematology, Conference on Concurrent Systems and Parallel Computation Project MAC, Woods Hole, Mass. June 2–5 (1970), 119–127.

  9. A. Pettorossi,Methodologies for program transformation and memoing. Ph.D. Thesis, Computer Science Department, Edinburgh University (1984).

  10. S. A. Walker and H. R. Strong,Characterization of flowchartable recursions, Journal of Computer and System Sciences 7(4) (1973), 404–447.

    Google Scholar 

  11. T. R. Walsh,Iteration strikes back at the Cyclic Towers of Hanoi. Information Processing Letters, 16 (1983), 91–93.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Analisi dei Sistemi ed Informatica del C.N.R., Viale Manzoni 30, 00185, Roma, Italy

    Alberto Pettorossi

Authors
  1. Alberto Pettorossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pettorossi, A. Towers of Hanoi problems: Deriving iterative solutions by program transformations. BIT 25, 327–334 (1985). https://doi.org/10.1007/BF01934378

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934378

Keywords

Search

Navigation