A New Lower Bound for the Towers of Hanoi Problem
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$.
2014 ◽
Vol 24
(4)
◽
pp. 658-679
◽
Keyword(s):
2020 ◽
Vol 29
(04)
◽
pp. 2050022
1997 ◽
Vol 6
(3)
◽
pp. 353-358
◽
Keyword(s):
1952 ◽
Vol 48
(4)
◽
pp. 625-639
◽
2008 ◽
Vol Vol. 10 no. 3
◽
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
2010 ◽
Vol 19
(11)
◽
pp. 1449-1456
◽