Geodesic
A new lower bound for the Towers of Hanoi problem
Codruƫ Grosu1
1Free University of Berlin
The electronic journal of combinatorics, Tome 23 (2016) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

More than a century after its proposal, the Towers of Hanoi puzzle with 4 pegs was solved by Thierry Bousch in a breakthrough paper in 2014. The general problem with $p$ pegs is still open, with the best lower bound on the minimum number of moves due to Chen and Shen. We use some of Bousch's new ideas to obtain an asymptotic improvement on this bound for all $p \geq 5$.
DOI : 10.37236/5503
Classification : 05A10, 05A16, 68R10
Mots-clés : Towers of Hanoi, shortest paths

Codruƫ Grosu  1

1 Free University of Berlin 
@article{10_37236_5503,
     author = {Codruƫ Grosu},
     title = {A new lower bound for the {Towers} of {Hanoi} problem},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {1},
     doi = {10.37236/5503},
     zbl = {1330.05008},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5503/}
}
TY  - JOUR
AU  - Codruƫ Grosu
TI  - A new lower bound for the Towers of Hanoi problem
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5503/
DO  - 10.37236/5503
ID  - 10_37236_5503
ER  - 
%0 Journal Article
%A Codruƫ Grosu
%T A new lower bound for the Towers of Hanoi problem
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/5503/
%R 10.37236/5503
%F 10_37236_5503
Codruƫ Grosu. A new lower bound for the Towers of Hanoi problem. The electronic journal of combinatorics, Tome 23 (2016) no. 1. doi: 10.37236/5503

Cité par Sources :