Title :
A simple iterative algorithm for the towers of Hanoi problem
Author :
Chedid, Fouad B. ; Mogi, T.
Author_Institution :
Temple Univ., Tokyo
fDate :
5/1/1996 12:00:00 AM
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;
Journal_Title :
Education, IEEE Transactions on
