Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
From MaRDI portal
Publication:4962728
DOI10.1145/1367064.1367065zbMath1446.68205MaRDI QIDQ4962728
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
Related Items
The tower of Hanoi problem on Path\(_h\) graphs, 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, Exponential vs. Subexponential Tower of Hanoi Variants