The fourth tower of Hanoi

zbMath1307.05006MaRDI QIDQ2258522

Thierry Bousch

Publication date: 26 February 2015

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bbms/1420071861

zbMATH Keywords

towers of HanoiFrame-Stewart conjecture

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics in computer science (68R05) Asymptotic enumeration (05A16)

Related Items (14)

Anti-Ramsey number of Hanoi graphs ⋮ A new lower bound for the Towers of Hanoi problem ⋮ Computational solution of an old tower of Hanoi problem ⋮ Bounded Hanoi ⋮ The Dudeney-Stockmeyer conjecture ⋮ Open problems for Hanoi and Sierpiński graphs ⋮ A tour of general Hanoi graphs ⋮ On Parking Functions and The Tower of Hanoi ⋮ What is the least number of moves needed to solve the k-peg Towers of Hanoi problem? ⋮ A survey and classification of Sierpiński-type graphs ⋮ Stockmeyer's tower ⋮ A note on the Frame–Stewart conjecture ⋮ Two-player tower of Hanoi ⋮ On the treewidth of Hanoi graphs

This page was built for publication: The fourth tower of Hanoi