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

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]

Abstract

Abstract is missing.