umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
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)Conference 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.
Keyword [en]
Mastermind, Game Theory, Upper Bound, Game Theory
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-139844OAI: oai:DiVA.org:umu-139844DiVA: diva2:1143852
Conference
Proceedings of 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017)
Available from: 2017-09-22 Created: 2017-09-22 Last updated: 2017-10-03

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Jäger, Gerold
By organisation
Department of Mathematics and Mathematical Statistics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

Total: 8 hits
CiteExportLink to record
Permanent link

Direct link
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