The Towers of Hanoi

Dr. Roger H. Abbott, Department of Zoology, Parks Road,
Oxford, England

This program uses a recursive routine to solve the Towers of
Hanoi problem. Either the total number of moves and the time
required, or the actual moves, will be typed on the teletype.
It is intended as a demonstration of the way in which recursion
may be used in FOCAL.

Minimum Hardware:
4K PDP-8, ASR33
Source Language:

Catalog: July 1973