Playing Mastermind With Constant-Size Memory

Details Playing Mastermind With Constant-Size Memory Playing Mastermind With Constant-Size Memory

2011-10-17

arxiv.org/abs/1110.3619v1

Computer Science

Data Structures and Algorithms

23 pages

Scientific paper

We analyze the classic board game of Mastermind with $n$ holes and a constant number of colors. A result of Chv\'atal (Combinatorica 3 (1983), 325-329) states that the codebreaker can find the secret code with $\Theta(n / \log n)$ questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory of Computing Systems 39 (2006), 525-544) on the memory-restricted black-box complexity of the OneMax function class.

Affiliated with

Also associated with

No associations

Rating

Playing Mastermind With Constant-Size Memory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Playing Mastermind With Constant-Size Memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Playing Mastermind With Constant-Size Memory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-317538