The towers of Antwerpen problem

DOI10.1016/0020-0190(91)90230-FzbMath0737.68044OpenAlexW2093611116MaRDI QIDQ1178204

Steven Minsker

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90230-f

zbMATH Keywords

recursionTowers of HanoiTowers of Antwerpen

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Exponential vs. Subexponential Tower of Hanoi Variants ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant ⋮ The Little Towers of Antwerpen problem

Cites Work

• Unnamed Item
• The super towers of Hanoi problem: Large rings on small rings
• The cyclic towers of Hanoi
• The Generalized Towers of Hanoi Problem
• The Towers of Hanoi rainbow problem: Coloring the rings

This page was built for publication: The towers of Antwerpen problem