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

DOI10.1016/0012-365X(93)90373-2MaRDI QIDQ685686zbMATH OpenFDO

Authors Carole S. Klein, Steven Minsker

Publication date 24 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)90373-2

zbMATH Keywords

recursive algorithmTowers of Hanoi

Mathematics Subject Classification ID

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

Recommendations

• The Generalized Towers of Hanoi Problem
• scientific article; zbMATH DE number 1264407
• scientific article; zbMATH DE number 501074
• scientific article; zbMATH DE number 1185160
• On Hanoi tower problems
• The Towers of Hanoi rainbow problem: Coloring the rings
• scientific article; zbMATH DE number 1439478
• The towers of Hanoi problem with cyclic parallel moves

Cites work

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

Cited in

(9)

• The Little Towers of Antwerpen problem
• The towers of Antwerpen problem
• Shortest paths between regular states of the Tower of Hanoi
• Santa Claus' Towers of Hanoi
• Exponential vs. Subexponential Tower of Hanoi Variants
• scientific article; zbMATH DE number 4011933 (Why is no real title available?)
• The Towers of Hanoi rainbow problem: Coloring the rings
• scientific article; zbMATH DE number 1087226 (Why is no real title available?)
• The tower of Hanoi problem with evildoer discs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685686)