On the query complexity of black-peg AB-mastermind

DOI10.3390/g9010002zbMath1403.91074arXiv1611.05907OpenAlexW2553938774MaRDI QIDQ1651863

Anand Srivastav, Christian Glazik, Volkmar Sauerland, Mourad El Ouali

Publication date: 10 July 2018

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.05907

zbMATH Keywords

complexityalgorithmcombinatorial problempermutationmastermind

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Related Items (4)

Query complexity of mastermind variants ⋮ The exact query complexity of yes-no permutation mastermind ⋮ Bounds for the static permutation mastermind game ⋮ Solving static permutation mastermind using \(O(n \log n)\) queries

Cites Work

• Mastermind
• The number of pessimistic guesses in Generalized Mastermind
• On the algorithmic complexity of the Mastermind game with black-peg results
• Efficient solutions for mastermind using genetic algorithms
• Query complexity of mastermind variants
• The number of pessimistic guesses in generalized black-peg mastermind
• The worst case number of questions in generalized AB game with and without white-peg answers
• Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
• Playing Mastermind with Constant-size Memory
• Playing Mastermind With Many Colors
• On the number of queries necessary to identify a permutation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the query complexity of black-peg AB-mastermind