The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
From MaRDI portal
Publication:477330
DOI10.1016/J.DAM.2014.03.011zbMATH Open1309.68142OpenAlexW2055534740MaRDI QIDQ477330FDOQ477330
Authors: Steven Minsker 
Publication date: 3 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.011
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
- The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
- The cyclic towers of Hanoi
- The Tower of Hanoi with Forbidden Moves
- The Little Towers of Antwerpen problem
- The cyclic multi-peg Tower of Hanoi
- The complexity of the generalised cyclic Towers of Hanoi problem
- The tower of Hanoi problem on Path\(_h\) graphs
- Optimality of an algorithm solving the bottleneck Tower of Hanoi problem
- On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
- The towers of Antwerpen problem
- Title not available (Why is that?)
- A generalization of the cyclic towers of hanoi: an iterative solution
- The Generalized Colour Towers of Hanoi: An Iterative Algorithm
- Title not available (Why is that?)
Cited In (3)
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)
