Another nonrecursive algorithm for the towers of Hanoi

Authors:
Manfred Stadel
Affiliations:
Siemens AG, ZTI SOF, Otto Hahn Ring 6, 8000 Mü/nchen 83, West Germany R</1>/H. Mayer, D. Perkins: "Towers of Hanoi revisited a nonrecursive surprise"/ SIGPLAN NOTICES 19, 2 (1984), pp. 80- ...
Venue:
ACM SIGPLAN Notices
Year:
1984

Citing 1
Cited 2

Towers of Hanoi revisited a nonrecursive surprise

ACM SIGPLAN Notices

The coroutines of Hanoi

ACM SIGPLAN Notices
The towers of Hanoi: yet another nonrecursive solution

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

A nonrecursive algorithm for solving the Towers of Hanoi problem is described. The advantage of this algorithm is that it can be easily used by a human to play the game.