Parallelism for multipeg towers of Hanoi
From MaRDI portal
Publication:1804221
DOI10.1016/0895-7177(94)00210-FzbMath0925.68341MaRDI QIDQ1804221
Publication date: 9 August 1999
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Related Items (2)
Parallelism for multipeg towers of Hanoi ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
Cites Work
- Unnamed Item
- A problem-decomposition method using differences or equivalence relations between states
- An iterative algorithm for the Tower of Hanoi with four pegs
- The Towers of Hanoi Problem
- The cyclic towers of Hanoi
- The towers of Hanoi revisited: Moving the rings by counting the moves
- The towers of Hanoi problem with parallel moves
- A note on parallelism for the towers of Hanoi
- Parallelism for multipeg towers of Hanoi
- Iteration strikes back - at the cyclic Towers of Hanoi
- The Generalized Colour Towers of Hanoi: An Iterative Algorithm
- Adjudicating a towers of hanoi contest†
- Towers of Hanoi and Analysis of Algorithms
- Towers of hanoi graphs
- Towers of hanoi problem with arbitraryk≧3 pages
- A statistical analysis of the towers of hanoi problem
- The Towers of Hanoi rainbow problem: Coloring the rings
- A Representation Approach to the Tower of Hanoi Problem
- A loopless approach to the multipeg towers of hanoi
- Discussion and correspondence: A note on the Towers of Hanoi problem
This page was built for publication: Parallelism for multipeg towers of Hanoi
