umu.sePublications
Change search

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
Bounds for Static Black-Peg AB Mastermind
Christian-Albrechts Universität Kiel.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
Christian-Albrechts Universität Kiel.
Christian-Albrechts Universität Kiel.
2017 (English)In: COCOA 2017: Combinatorial Optimization and Applications, Springer Berlin/Heidelberg, 2017, p. 409-424Conference paper, Published paper (Refereed)
##### Abstract [en]

Mastermind is a famous two-player game introduced by M. Meirowitz (1970). Its combinatorics has gained increased interest over the last years   for different variants.

In this paper we consider a version known as the Black-Peg AB Game, where one player creates a secret code consisting of c colors on p <= c pegs, where each color is used at most once. The second player tries to guess the secret code with as few questions as possible. For each question he receives the number of correctly placed colors. In the static variant the second player doesn't receive the answers one at a time,  but all at once after asking the last question.  There are several results both for the AB and the static version, but the combination of both versions has not been considered so far. The most prominent case is n:=p=c, where the secret code and all questions are permutations. The main result of this paper is an upper bound of O(n^{1.525}) questions for this setting. With a slight modification of the arguments of Doerr et al. (2016) we also give a lower bound of \Omega(n\log n). Furthermore, we complement the upper bound for p=c  by an optimal (\lceil 4c/3 \rceil -1)-strategy for the special case p=2 and arbitrary c >= 2 and list optimal strategies for six additional pairs (p,c) .

##### Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2017. p. 409-424
##### Series
Lecture Notes in Computer Science ; 10628
##### Keywords [en]
Mastermind, Game Theory, Upper Bound, Game Theory
##### National Category
Discrete Mathematics
##### Identifiers
ISBN: 978-3-319-71146-1 (print)ISBN: 978-3-319-71147-8 (electronic)OAI: oai:DiVA.org:umu-139844DiVA, id: diva2:1143852
##### Conference
The 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Shanghai, China, December 16-18, 2017
Available from: 2017-09-22 Created: 2017-09-22 Last updated: 2019-06-26Bibliographically approved

#### Open Access in DiVA

No full text in DiVA

Publisher's full text

Jäger, Gerold

#### Search in DiVA

Jäger, Gerold
##### By organisation
Department of Mathematics and Mathematical Statistics
##### On the subject
Discrete Mathematics

doi
isbn
urn-nbn

#### Altmetric score

doi
isbn
urn-nbn
Total: 130 hits

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf