Discussion and correspondence: A note on the Towers of Hanoi problem
Open Access
- 1 January 1977
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 20 (3) , 282-285
- https://doi.org/10.1093/comjnl/20.3.282
Abstract
The Towers of Hanoi problem is often used in introductory programming texts to illustrate the power of recursion. In this note, however, I shall investigate the problem a little further and show how a rather different approach yields a very different nonrecursive solution. I shall use this example to illustrate some vague general points about techniques of programming and the meaning of programs.Keywords
This publication has 0 references indexed in Scilit: