Towers of Hanoi problems: deriving iterative solutions by program transformations
From MaRDI portal
Recommendations
- Pour en finir avec la dérécursivation du problème des tours de Hanoï
- An iterative optimal algorithm for the generalized tower of hanoi problem
- An iterative algorithm for the cyclic Towers of Hanoi problem
- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
- A generalization of the cyclic towers of hanoi: an iterative solution
Cites work
- A Transformation System for Developing Recursive Programs
- An iterative solution to the generalized Towers of Hanoi problem
- Characterization of flowchartable recursions
- Discussion and correspondence: A note on the Towers of Hanoi problem
- Iteration strikes back - at the cyclic Towers of Hanoi
- The Generalized Towers of Hanoi Problem
- The Towers of Hanoi Problem
- The cyclic towers of Hanoi
Cited in
(10)- scientific article; zbMATH DE number 7453187 (Why is no real title available?)
- Derivation of efficient programs for computing sequences of actions
- Modeling recursion with the aid of iterative algorithms
- An iterative algorithm for the cyclic Towers of Hanoi problem
- A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
- Pour en finir avec la dérécursivation du problème des tours de Hanoï
- Shortest paths between regular states of the Tower of Hanoi
- Computational solution of an old tower of Hanoi problem
- scientific article; zbMATH DE number 3947600 (Why is no real title available?)
- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
This page was built for publication: Towers of Hanoi problems: deriving iterative solutions by program transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067772)