Hanabi is NP-complete, even for cheaters who look at their cards (Q5282800)
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: Hanabi is NP-complete, even for cheaters who look at their cards |
scientific article; zbMATH DE number 6747550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hanabi is NP-complete, even for cheaters who look at their cards |
scientific article; zbMATH DE number 6747550 |
Statements
17 July 2017
0 references
Hanabi
0 references
algorithmic combinatorial game theory
0 references
sorting
0 references
0.9855135679244996
0 references
0.8321227431297302
0 references
0.7757642865180969
0 references
0.7510488033294678
0 references
0.7452083230018616
0 references
