On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results

Details On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results

2009-04-30

arxiv.org/abs/0904.4911v1

Information Processing Letters, Volume 109, 675-678, 2009

Computer Science

Data Structures and Algorithms

Expanded version with a figure showing the Mastermind game

Scientific paper

10.1016/j.ipl.2009.02.021

In this paper, we study the algorithmic complexity of the Mastermind game, where results are single-color black pegs. This differs from the usual dual-color version of the game, but better corresponds to applications in genetics. We show that it is NP-complete to determine if a sequence of single-color Mastermind results have a satisfying vector. We also show how to devise efficient algorithms for discovering a hidden vector through single-color queries. Indeed, our algorithm improves a previous method of Chvatal by almost a factor of 2.

Affiliated with

Also associated with

No associations

Rating

On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results 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 On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444050