On the algorithmic complexity of the Mastermind game with black-peg results (Q989451)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic complexity of the Mastermind game with black-peg results |
scientific article |
Statements
On the algorithmic complexity of the Mastermind game with black-peg results (English)
0 references
20 August 2010
0 references
algorithms
0 references
NP-completeness
0 references
mastermind
0 references
