On the algorithmic complexity of the Mastermind game with black-peg results (Q989451): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045496672 / rank | |||
Normal rank | |||
| 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
