skip to main content
article
Free Access

A simpler iterative solution to the Towers of Hanoi problem

Published:01 August 1984Publication History

Abstract

No abstract available.

References

  1. H. Mayer and D. Perkins, "Towers of Hanoi Revisited, A Nonrecursive Surprise", ACM SIGPLAN Notices 19 (2), (February 1984) pp. 80--84. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A simpler iterative solution to the Towers of Hanoi problem
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGPLAN Notices
      ACM SIGPLAN Notices  Volume 19, Issue 8
      August 1984
      76 pages
      ISSN:0362-1340
      EISSN:1558-1160
      DOI:10.1145/988241
      Issue’s Table of Contents

      Copyright © 1984 Author

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 August 1984

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader