Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Towers of Hanoi revisited a nonrecursive surprise
Home
Publications
Towers of Hanoi revisited a nonrecursive surprise
Towers of Hanoi revisited a nonrecursive surprise
Authors:
HM
Herbert Mayer
Herbert Mayer
DP
Don Perkins
Don Perkins
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Open Access
Publisher website
Google Scholar
1 February 1984
journal article
Published by
Association for Computing Machinery (ACM)
in
ACM SIGPLAN Notices
Vol. 19
(2)
,
80-84
DOI:
10.1145/948566.948573
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.
Keywords
SURPRISE
FORTRAN
Related articles
Cited
Cited by 15 articles
Scroll to top