On the algorithmic complexity of the Mastermind game with black-peg results (Q989451)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the algorithmic complexity of the Mastermind game with black-peg results |
scientific article; zbMATH DE number 5773775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the algorithmic complexity of the Mastermind game with black-peg results |
scientific article; zbMATH DE number 5773775 |
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
0.89612424
0 references
0.86629045
0 references
0.86617434
0 references
0.8589387
0 references
0.85543376
0 references
0.84816957
0 references
0.8451046
0 references
0.8432703
0 references
0 references
