- H. Mayer and D. Perkins, "Towers of Hanoi Revisited, A Nonrecursive Surprise", ACM SIGPLAN Notices 19 (2), (February 1984) pp. 80--84. Google ScholarDigital Library
Index Terms
A simpler iterative solution to the Towers of Hanoi problem
Recommendations
An iterative solution to the four-peg Tower of Hanoi problem
CSC '90: Proceedings of the 1990 ACM annual conference on CooperationOne of the variations of the Towers of Hanoi puzzle allows for p pegs, and for four pegs the solution to this variation is shown to have a simple structure which can be used to derive an iterative solution to the problem.
Nonrecursive solution to parallel multipeg Towers of Hanoi: A decomposition approach
By decomposing the recursive solution established in [1] into what we call sectors, a nonrecursive solution is obtained for the parallel multipeg Towers of Hanoi problem. The decomposition discloses more inherent properties of the existing recursive ...
An iterative solution to the generalized Towers of Hanoi problem
AbstractAn iterative solution to the generalized Towers of Hanoi problem, and its derivation are presented. In this generalization, one or more towers, consisting of a total ofn discs, are given as an initial legal configuration, and the task is to move ...
Comments