The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
From MaRDI portal
Publication:477330
Recommendations
- The towers of Hanoi problem with cyclic parallel moves
- A generalization of the cyclic towers of hanoi: an iterative solution
- Note on the cyclic towers of Hanoi
- The cyclic multi-peg Tower of Hanoi
- The towers of Antwerpen problem
- The Generalized Towers of Hanoi Problem
- The complexity of the generalised cyclic Towers of Hanoi problem
- An iterative algorithm for the cyclic Towers of Hanoi problem
- scientific article; zbMATH DE number 501074
Cites work
- scientific article; zbMATH DE number 4178767 (Why is no real title available?)
- scientific article; zbMATH DE number 3763944 (Why is no real title available?)
- A generalization of the cyclic towers of hanoi: an iterative solution
- On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
- Optimality of an algorithm solving the bottleneck Tower of Hanoi problem
- The Generalized Colour Towers of Hanoi: An Iterative Algorithm
- The Little Towers of Antwerpen problem
- The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
- The Tower of Hanoi with Forbidden Moves
- The complexity of the generalised cyclic Towers of Hanoi problem
- The cyclic multi-peg Tower of Hanoi
- The cyclic towers of Hanoi
- The tower of Hanoi problem on Path\(_h\) graphs
- The towers of Antwerpen problem
Cited in
(4)
This page was built for publication: The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477330)