On a question of Leiss regarding the Hanoi Tower problem
From MaRDI portal
Publication:861280
DOI10.1016/j.tcs.2006.09.019zbMath1140.68074OpenAlexW2088164183MaRDI QIDQ861280
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.019
Analysis of algorithms (68W40) Directed graphs (digraphs), tournaments (05C20) Combinatorial games (91A46)
Related Items (5)
The worst parallel Hanoi graphs ⋮ The worst Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph ⋮ Exponential vs. Subexponential Tower of Hanoi Variants
Cites Work
- The Towers of Hanoi Problem
- The complexity of the generalised cyclic Towers of Hanoi problem
- Towers of Hanoi and Analysis of Algorithms
- The Towers of Hanoi rainbow problem: Coloring the rings
- The Tower of Hanoi with Forbidden Moves
- Pascal's Triangle and the Tower of Hanoi
- Developments in Language Theory
- Unnamed Item
- Unnamed Item
This page was built for publication: On a question of Leiss regarding the Hanoi Tower problem
