Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.
Jean-François BaffierMan-Kwun ChiuYago DiezMatias KormanValia MitsouAndré van RenssenMarcel RoeloffzenYushi UnoPublished in: FUN (2016)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- computational complexity
- constraint satisfaction problems
- np complete problems
- phase transition
- pspace complete
- data complexity
- conjunctive queries
- bounded treewidth
- artificial intelligence
- search algorithm
- optimal solution
- polynomially solvable
- constraint satisfaction
- data structure
- multiscale