Towers of Hanoi revisited a nonrecursive surprise

Authors:
Herbert Mayer;Don Perkins
Affiliations:
San Diego State University, San Diego, Ca.;San Diego State University, San Diego, Ca.
Venue:
ACM SIGPLAN Notices
Year:
1984

Citing 0
Cited 10

Spin-out: the Chinese rings in the classroom

SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
The towers of Hanoi from a different viewpoint

ACM SIGPLAN Notices
A note on iterative Hanoi

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
Solution of the Tower of Hanoi problem using a binary tree

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

ACM SIGPLAN Notices
Chinese Rings and recursion

ACM SIGCSE Bulletin
Binary number applications

Journal of Computing Sciences in Colleges

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple algorithm that solves the inherently recursive towers of Hanoi problem via iteration. To demonstrate the feasibility of the solution an implementation in Fortran with generated run-time output is appended.