Hanabi is NP-hard, even for cheaters who look at their cards (Q528493)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6715037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hanabi is NP-hard, even for cheaters who look at their cards |
scientific article; zbMATH DE number 6715037 |
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
0.9855135679244996
0 references
0.8345984816551208
0 references
0.7526482343673706
0 references
0.725467324256897
0 references
0.7223159670829773
0 references
