Hanabi is NP-hard, even for cheaters who look at their cards (Q528493): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2017.02.024 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2017.02.024 / rank | |||
Normal rank | |||
Latest revision as of 20:34, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hanabi is NP-hard, even for cheaters who look at their cards |
scientific article |
Statements
Hanabi is NP-hard, even for cheaters who look at their cards (English)
0 references
12 May 2017
0 references
algorithmic combinatorial game theory
0 references
computational complexity
0 references
solitaire games
0 references
sorting
0 references
