Towers of Hanoi revisited a nonrecursive surprise

@article{Mayer1984TowersOH,
  title={Towers of Hanoi revisited a nonrecursive surprise},
  author={H. Mayer and D. Perkins},
  journal={ACM SIGPLAN Notices},
  year={1984},
  volume={19},
  pages={80-84}
}
  • H. Mayer, D. Perkins
  • Published 1984
  • Computer Science
  • ACM SIGPLAN Notices
    • 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. 
    View on ACM
    doi.org
    16 Citations
    Highly Influencial Citations
    1
    Background Citations
    3
    Methods Citations
    1

    Topics from this paper

    Explore Further: Topics Discussed in This Paper

    16 Citations
    Citation Type

    Citation Type

    A note on iterative Hanoi
    • 6
    • Highly Influenced
    • PDF
    Student Monks: Teaching Recursion in an IS or CS Programming Course using the Towers of Hanoi
    • 12
    • PDF
    Binary number applications
    The Tower of Hanoi: A Bibliography
    • 21
    • PDF
    An empirical analysis of debugging performance - differences between iterative and recursive constructs
    • 18
    Recursion vs. Iteration: An Empirical Study of Comprehension
    • 16
    A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc
    • M. Er
    • Mathematics, Computer Science
    • Inf. Sci.
    • 1989
    • 3
    A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
    • 3
    Spin-out: the Chinese rings in the classroom
    • 2
    Chinese Rings and recursion
    • 4