An iterative optimal algorithm for the generalized tower of hanoi problem
From MaRDI portal
Publication:3348426
Recommendations
- The complexity of an optimal algorithm for the generalized tower of hanoi problem
- The Generalized Towers of Hanoi Problem
- The Generalized Colour Towers of Hanoi: An Iterative Algorithm
- A generalization of the cyclic towers of hanoi: an iterative solution
- An iterative algorithm for the cyclic Towers of Hanoi problem
Cited in
(20)- An iterative algorithm for the Tower of Hanoi with four pegs
- The complexity of an optimal algorithm for the generalized tower of hanoi problem
- An Algorithmic Solution to the Multi-tower Hanoi Problem
- An iterative algorithm for the cyclic Towers of Hanoi problem
- The Generalized Towers of Hanoi Problem
- On uniqueness of solution to the multi-peg towers of hanoi
- 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 Colour Towers of Hanoi: An Iterative Algorithm
- Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
- The Towers of Hanoi and Binary Numerals
- An optimal algorithm to implement the Hanoi towers with parallel moves
- The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem
- The Colour Towers of Hanoi – An Iterative Solution
- A general algorithm for finding a shortest path between two n- configurations
- scientific article; zbMATH DE number 4178767 (Why is no real title available?)
- The weighted tower of Hanoi
- Towers of Hanoi problems: deriving iterative solutions by program transformations
- scientific article; zbMATH DE number 3947600 (Why is no real title available?)
- The complexity of the generalised cyclic Towers of Hanoi problem
This page was built for publication: An iterative optimal algorithm for the generalized tower of hanoi problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348426)