A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
From MaRDI portal
Recommendations
- A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
- Towers of Hanoi and Analysis of Algorithms
- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
- An Algorithmic Solution to the Multi-tower Hanoi Problem
- The Generalized Towers of Hanoi Problem
Cites work
- A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
- A Representation Approach to the Tower of Hanoi Problem
- Discussion and correspondence: A note on the Towers of Hanoi problem
- scientific article; zbMATH DE number 3303978 (Why is no real title available?)
- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
- The Towers of Hanoi Problem
- The towers of Hanoi revisited: Moving the rings by counting the moves
Cited in
(6)- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
- A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
- Computational solution of an old tower of Hanoi problem
- Towers of Hanoi and Analysis of Algorithms
- Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
- A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
This page was built for publication: A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5751947)