Open access
Datum
2022-01-28Typ
- Journal Article
ETH Bibliographie
yes
Altmetrics
Abstract
Permutation Mastermind is a version of the classical mastermind game in which the number of positions n is equal to the number of colors k, and repetition of colors is not allowed, neither in the codeword nor in the queries. In this paper we solve the main open question from Glazik, Jäger, Schiemann and Srivastav (2021), who asked whether their bound of O(n1.525) for the static version can be improved to O(n log n), which would be best possible. By using a simple probabilistic argument we show that this is indeed the case. Mehr anzeigen
Persistenter Link
https://doi.org/10.3929/ethz-b-000537930Publikationsstatus
publishedExterne Links
Zeitschrift / Serie
The Electronic Journal of CombinatoricsBand
Seiten / Artikelnummer
Verlag
Electronic Journal of CombinatoricsOrganisationseinheit
03672 - Steger, Angelika / Steger, Angelika
ETH Bibliographie
yes
Altmetrics