Paper Info
Title
A New Lower Bound for the Towers of Hanoi Problem.
Abstract
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 >= 5.
Year
Venue
Keywords
2016
ELECTRONIC JOURNAL OF COMBINATORICS
Towers of Hanoi,Frame-Stewart algorithm,shortest paths
Field
DocType
Volume
Discrete mathematics,Combinatorics,Chen,Upper and lower bounds,Mathematics
Journal
23.0
Issue
ISSN
Citations 
1.0
1077-8926
0
PageRank 
References 
Authors
0.34
4
1
Name
Order
Citations
PageRank
Codrut Grosu112.09