On the algorithmic complexity of the Mastermind game with black-peg results (Q989451): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Mastermind / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4132291 / rank | |||
Normal rank | |||
Latest revision as of 02:20, 3 July 2024
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
