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

DOI10.1016/0012-365X(93)90373-2zbMATH Open0776.68091MaRDI QIDQ685686FDOQ685686

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)

Cites Work

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

Cited In (4)

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

   Recommendations

• The Generalized Towers of Hanoi Problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On Hanoi tower problems 👍 👎
• The Towers of Hanoi rainbow problem: Coloring the rings 👍 👎
• Title not available (Why is that?) 👍 👎
• The towers of Hanoi problem with cyclic parallel moves 👍 👎

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)