The towers of Hanoi: yet another nonrecursive solution

Authors:
Bleicke Eggers
Affiliations:
Technische Universität Berlin, Berlin
Venue:
ACM SIGPLAN Notices
Year:
1985

Citing 5
Cited 1

A note on iterative Hanoi

ACM SIGPLAN Notices
Towers of Hanoi revisited a nonrecursive surprise

ACM SIGPLAN Notices
Another nonrecursive algorithm for the towers of Hanoi

ACM SIGPLAN Notices
A simpler iterative solution to the Towers of Hanoi problem

ACM SIGPLAN Notices
The coroutines of Hanoi

ACM SIGPLAN Notices

The towers of Hanoi from a different viewpoint

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

Another nonrecursive algorithm for The towers of Hanoi Problem is presented. It serves to compute the disk configuration from a given move number and the disk to be moved together with its current peg and target. The procedure gives rise to detect faults in erroneous computations.