On Optimal Solutions for the Bottleneck Tower of Hanoi Problem

DOI10.1007/978-3-540-69507-3_20MaRDI QIDQ5448776zbMATH OpenOpenAlexFDO

Authors Shay Solomon, Yefim Dinitz

Publication date 7 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69507-3_20

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorics in computer science (68R05)

Recommendations

• Optimality of an algorithm solving the bottleneck Tower of Hanoi problem
• Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
• scientific article; zbMATH DE number 1439478
• New variants of the bottleneck tower of Hanoi problems
• The Tower of Hanoi with Forbidden Moves

Cited in

(10)

• Santa Claus' Towers of Hanoi
• The tower of Hanoi problem on Path\(_h\) graphs
• scientific article; zbMATH DE number 501074 (Why is no real title available?)
• The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant
• Optimality of an algorithm solving the bottleneck Tower of Hanoi problem
• The Reve's puzzle with an evildoer disc
• New variants of the bottleneck tower of Hanoi problems
• On the average-case complexity of the Bottleneck Tower of Hanoi problem
• Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
• A tour of general Hanoi graphs

This page was built for publication: On Optimal Solutions for the Bottleneck Tower of Hanoi Problem

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