Gerold Jäger, Marcin Peczarski. Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. In Jan Kratochvíl, Mirka Miller, Dalibor Froncek, editors, Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers. Volume 8986 of Lecture Notes in Computer Science, pages 188-199, Springer, 2014. [doi]
@inproceedings{JagerP14,
title = {Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory},
author = {Gerold Jäger and Marcin Peczarski},
year = {2014},
doi = {10.1007/978-3-319-19315-1_17},
url = {http://dx.doi.org/10.1007/978-3-319-19315-1_17},
researchr = {https://researchr.org/publication/JagerP14},
cites = {0},
citedby = {0},
pages = {188-199},
booktitle = {Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers},
editor = {Jan Kratochvíl and Mirka Miller and Dalibor Froncek},
volume = {8986},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-19314-4},
}