dc.contributor.author
Grosu, Codrut
dc.date.accessioned
2018-06-08T04:23:19Z
dc.date.available
2016-03-21T12:27:07.596Z
dc.identifier.uri
https://refubium.fu-berlin.de/handle/fub188/17191
dc.identifier.uri
http://dx.doi.org/10.17169/refubium-21369
dc.description.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.
en
dc.rights.uri
http://www.combinatorics.org/ojs/index.php/eljc/about/submissions#copyrightNotice
dc.subject
Towers of Hano
dc.subject
Frame-Stewart algorithm
dc.subject
shortest paths
dc.subject.ddc
500 Naturwissenschaften und Mathematik::510 Mathematik
dc.title
A New Lower Bound for the Towers of Hanoi Problem
dc.type
Wissenschaftlicher Artikel
dcterms.bibliographicCitation
Electronic Journal of Combinatorics. - 23 (2016), 1, Artikel Nr. P1.22
dcterms.bibliographicCitation.url
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p22/pdf
refubium.affiliation
Mathematik und Informatik
de
refubium.mycore.fudocsId
FUDOCS_document_000000024198
refubium.resourceType.isindependentpub
no
refubium.mycore.derivateId
FUDOCS_derivate_000000006149
dcterms.accessRights.openaire
open access
