Parallelism for multipeg towers of Hanoi

DOI10.1016/0895-7177(94)00210-FMaRDI QIDQ1804221zbMATH OpenFDO

Authors Yanyan Li

Publication date 9 August 1999

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(94)00210-F

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A loopless approach to the multipeg towers of hanoi
• A note on parallelism for the towers of Hanoi
• A problem-decomposition method using differences or equivalence relations between states
• A Representation Approach to the Tower of Hanoi Problem
• A statistical analysis of the towers of hanoi problem
• Adjudicating a towers of hanoi contest†
• An iterative algorithm for the Tower of Hanoi with four pegs
• Discussion and correspondence: A note on the Towers of Hanoi problem
• scientific article; zbMATH DE number 3518812 (Why is no real title available?)
• Iteration strikes back - at the cyclic Towers of Hanoi
• Parallelism for multipeg towers of Hanoi
• The cyclic towers of Hanoi
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• The Towers of Hanoi Problem
• The towers of Hanoi problem with parallel moves
• The Towers of Hanoi rainbow problem: Coloring the rings
• The towers of Hanoi revisited: Moving the rings by counting the moves
• Towers of Hanoi and Analysis of Algorithms
• Towers of hanoi graphs
• Towers of hanoi problem with arbitraryk≧3 pages

Cited in

(2)

• Parallelism for multipeg towers of Hanoi
• Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach

This page was built for publication: Parallelism for multipeg towers of Hanoi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804221)