Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory

DOI10.1007/978-3-319-19315-1_17zbMath1401.91036OpenAlexW1827784960MaRDI QIDQ2946054

Gerold Jäger, Marcin Peczarski

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_17

zbMATH Keywords

game theoryspace complexityMastermindlogic game

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probabilistic games; gambling (91A60)

Related Items (2)

An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs ⋮ Bounding memory for Mastermind might not make it harder

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mastermind
• Memory-restricted black-box complexity of OneMax
• The number of pessimistic guesses in Generalized Mastermind
• On the algorithmic complexity of the Mastermind game with black-peg results
• The number of pessimistic guesses in generalized black-peg mastermind
• Playing mastermind with constant-size memory
• The worst case number of questions in generalized AB game with and without white-peg answers
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Playing Mastermind with Constant-size Memory
• Playing Mastermind With Many Colors

This page was built for publication: Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory