The super towers of Hanoi problem: Large rings on small rings

DOI10.1016/0012-365X(93)90373-2zbMath0776.68091MaRDI QIDQ685686

Carole S. Klein, Steven Minsker

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

recursive algorithmTowers of Hanoi

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (max. 100)

Santa Claus' Towers of Hanoi ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ The towers of Antwerpen problem ⋮ Shortest paths between regular states of the Tower of Hanoi

Cites Work

• The cyclic towers of Hanoi
• The Generalized Towers of Hanoi Problem
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• The Towers of Hanoi rainbow problem: Coloring the rings

This page was built for publication: The super towers of Hanoi problem: Large rings on small rings