Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem

DOI10.1145/1367064.1367065zbMath1446.68205OpenAlexW2058956491MaRDI QIDQ4962728

Shay Solomon

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1367064.1367065

zbMATH Keywords

Tower of Hanoioptimality proofs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Related Items (5)

A tour of general Hanoi graphs ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant ⋮ A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles

This page was built for publication: Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem