Bounding memory for Mastermind might not make it harder
From MaRDI portal
Publication:2355703
DOI10.1016/j.tcs.2015.06.039zbMath1328.68095OpenAlexW1887874897MaRDI QIDQ2355703
Marcin Peczarski, Gerold Jäger
Publication date: 24 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.039
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mastermind
- 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
- Playing Mastermind with Constant-size Memory
- Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
- Playing Mastermind With Many Colors
This page was built for publication: Bounding memory for Mastermind might not make it harder