Hanabi is NP-hard, even for cheaters who look at their cards (Q528493): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 91A46 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6715037 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithmic combinatorial game theory | |||
| Property / zbMATH Keywords: algorithmic combinatorial game theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
solitaire games | |||
| Property / zbMATH Keywords: solitaire games / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sorting | |||
| Property / zbMATH Keywords: sorting / rank | |||
Normal rank | |||
Revision as of 08:14, 1 July 2023
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
