On the algorithmic complexity of the Mastermind game with black-peg results

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-co...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 109; no. 13; pp. 675 - 678
Main Author: Goodrich, Michael T.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 15.06.2009
Elsevier
Elsevier Sequoia S.A
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Genetics
Information processing
Mastermind
Miscellaneous
NP-completeness
Studies
Theoretical computing
Mastermind
Algorithms
NP-completeness
Computer theory
Query
Color
Algorithmics
Algorithm
Completeness
Algorithm complexity
Information processing
Genetics
Application
Vector
Algorithm analysis
ISSN:0020-0190, 1872-6119
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 Chvátal by almost a factor of 2.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2009.02.021