• DocumentCode
    971724
  • Title

    A simple iterative algorithm for the towers of Hanoi problem

  • Author

    Chedid, Fouad B. ; Mogi, T.

  • Author_Institution
    Temple Univ., Tokyo
  • Volume
    39
  • Issue
    2
  • fYear
    1996
  • fDate
    5/1/1996 12:00:00 AM
  • Firstpage
    274
  • Lastpage
    275
  • Abstract
    The towers of Hanoi game is well known. The basic version, a favorite example for many authors, is often used in introductory textbooks on computer programming to demonstrate the elegance of writing recursive code. Here, a simple iterative optimal algorithm for the towers of Hanoi problem is presented
  • Keywords
    computer science education; operations research; optimisation; programming; computer programming education; introductory textbooks; iterative optimal algorithm; recursive code; towers of Hanoi problem; Binary trees; Costs; Displays; Iterative algorithms; Poles and towers; Programming; Upper bound; Writing;
  • fLanguage
    English
  • Journal_Title
    Education, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9359
  • Type

    jour

  • DOI
    10.1109/13.502075
  • Filename
    502075
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=971724