Publication:3177818

DOI10.1145/2987372zbMath1425.91078arXiv1207.0773OpenAlexW1923754076MaRDI QIDQ3177818

Henning Thomas, Reto Spöhel, Benjamin Doerr, Carola Doerr, Carola Winzen

Publication date: 2 August 2018

Published in: Journal of the ACM, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmscombinatorial gamesquery complexityMastermind

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial games (91A46)

Related Items (13)

On the query complexity of black-peg AB-mastermind ⋮ Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory ⋮ Query complexity of mastermind variants ⋮ An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ Optimal schemes for combinatorial query problems with integer feedback ⋮ Unnamed Item ⋮ The exact query complexity of yes-no permutation mastermind ⋮ Bounds for the static permutation mastermind game ⋮ The query complexity of a permutation-based variant of mastermind ⋮ Solving static permutation mastermind using \(O(n \log n)\) queries ⋮ The Query Complexity of Finding a Hidden Permutation ⋮ The worst case number of questions in generalized AB game with and without white-peg answers ⋮ Bounding memory for Mastermind might not make it harder

This page was built for publication: Playing Mastermind With Many Colors