The Towers of Hanoi Problem
From MaRDI portal
Cites work
Cited in
(35)- Tours de Hanoï et automates
- On the discretization in time for a parabolic integrodifferential equation with a weakly singular kernel. I: Smooth initial data
- Iteration strikes back - at the cyclic Towers of Hanoi
- Derivation of efficient programs for computing sequences of actions
- On a question of Leiss regarding the Hanoi Tower problem
- A loopless approach to the multipeg towers of hanoi
- An iterative algorithm for the cyclic Towers of Hanoi problem
- The cyclic towers of Hanoi
- The Generalized Towers of Hanoi Problem
- Loopless Gray code enumeration and the Tower of Bucharest
- A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
- A generalization of the cyclic towers of hanoi: an iterative solution
- The generalized Towers of Hanoi for space-deficient computers and forgetful humans
- Pour en finir avec la dérécursivation du problème des tours de Hanoï
- The Towers of Hanoi and Binary Numerals
- Recursive information transducers: Computation models
- An optimal algorithm to implement the Hanoi towers with parallel moves
- The towers of Hanoi problem with parallel moves
- The Colour Towers of Hanoi – An Iterative Solution
- A general algorithm for finding a shortest path between two n- configurations
- A note on parallelism for the towers of Hanoi
- A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
- The associativity of equivalence and the Towers of Hanoi problem
- Towers of Hanoi problems: deriving iterative solutions by program transformations
- Parallelism for multipeg towers of Hanoi
- The multiway trees of hanoi†
- The Cyclic Towers of Hanoi and Pseudo Ternary Codes
- An iterative solution to the generalized Towers of Hanoi problem
- The towers of Hanoi problem with cyclic parallel moves
- An analysis of the generalized Towers of Hanoi problem
- A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
- A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle
- A statistical analysis of the towers of hanoi problem
- The towers of Hanoi revisited: Moving the rings by counting the moves
- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
This page was built for publication: The Towers of Hanoi Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142217)