A new lower bound for the Towers of Hanoi problem

zbMath1330.05008arXiv1508.04272MaRDI QIDQ2635086

Codruţ Grosu

Publication date: 11 February 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.04272

zbMATH Keywords

shortest pathsTowers of Hanoi

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Graph theory (including graph drawing) in computer science (68R10) Asymptotic enumeration (05A16)

Related Items (1)

Stockmeyer's tower

Cites Work

• The number of moves of the largest disc in shortest paths on Hanoi graphs
• The fourth tower of Hanoi
• On the Frame--Stewart Conjecture about the Towers of Hanoi

This page was built for publication: A new lower bound for the Towers of Hanoi problem