The Cyclic Towers of Antwerpen problem - A challenging Hanoi variant

Abstract

The Cyclic Towers of Antwerpen problem consists of three variations on the Cyclic Towers of Hanoi problem, involving the exchange or rotation of three stacks of rings (red, white, blue), subject to the usual Hanoi rules plus the additional constraint that rings can only move clockwise. An optimal algorithm (minimal number of ring moves) is presented for one… (More)
DOI: 10.1016/j.dam.2014.03.011

Topics

Cite this paper

@article{Minsker2014TheCT, title={The Cyclic Towers of Antwerpen problem - A challenging Hanoi variant}, author={Steven Minsker}, journal={Discrete Applied Mathematics}, year={2014}, volume={179}, pages={44-53} }