The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant

DOI10.1016/J.DAM.2014.03.011zbMath1309.68142OpenAlexW2055534740MaRDI QIDQ477330

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

zbMATH Keywords

analysis of algorithmsrecursiontowers of Hanoitowers of Antwerpen

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05)

Cites Work

• Unnamed Item
• Unnamed Item
• The tower of Hanoi problem on Path\(_h\) graphs
• The Little Towers of Antwerpen problem
• The cyclic towers of Hanoi
• The towers of Antwerpen problem
• The Tower of Hanoi – Myths and Maths
• The cyclic multi-peg Tower of Hanoi
• A generalization of the cyclic towers of hanoi: an iterative solution
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• The complexity of the generalised cyclic Towers of Hanoi problem
• The Tower of Hanoi with Forbidden Moves
• Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
• On Optimal Solutions for the Bottleneck Tower of Hanoi Problem

This page was built for publication: The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant