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: CoRR (2016)
Keyphrases
- np complete
- np hard
- satisfiability problem
- randomly generated
- constraint satisfaction problems
- computational complexity
- conjunctive queries
- np complete problems
- pspace complete
- polynomial time complexity
- computationally complex
- polynomially solvable
- bounded treewidth
- lower bound
- evolutionary algorithm
- artificial intelligence
- machine learning
- databases