Playing Mastermind with Constant-size Memory
From MaRDI portal
Publication:2904783
DOI10.4230/LIPIcs.STACS.2012.441zbMath1245.68144arXiv1110.3619OpenAlexW2504769075MaRDI QIDQ2904783
Publication date: 23 August 2012
Full work available at URL: https://arxiv.org/abs/1110.3619
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Combinatorics in computer science (68R05)
Related Items (9)
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 ⋮ A framework for co-optimization algorithm performance and its application to worst-case optimization ⋮ Reducing the arity in unbiased black-box complexity ⋮ Playing mastermind with constant-size memory ⋮ Toward a unifying framework for evolutionary processes ⋮ Unbiasedness of estimation-of-distribution algorithms ⋮ 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 Constant-size Memory
