Open access
Date
2022-01-28Type
- Journal Article
ETH Bibliography
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. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000537930Publication status
publishedExternal links
Journal / series
The Electronic Journal of CombinatoricsVolume
Pages / Article No.
Publisher
Electronic Journal of CombinatoricsOrganisational unit
03672 - Steger, Angelika / Steger, Angelika
More
Show all metadata
ETH Bibliography
yes
Altmetrics