Hanabi is NP-hard, even for cheaters who look at their cards.
Jean-François BaffierMan-Kwun ChiuYago DiezMatias KormanValia MitsouAndré van RenssenMarcel RoeloffzenYushi UnoPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- np hard
- special case
- scheduling problem
- approximation algorithms
- optimal solution
- linear programming
- minimum cost
- closely related
- worst case
- np hardness
- integer programming
- branch and bound algorithm
- lower bound
- constraint satisfaction problems
- np complete
- greedy heuristic
- artificial neural networks
- knapsack problem
- computational complexity
- maximum weight
- polynomial time approximation
- database
- computationally hard
- card games
- rfid tags
- mobile robot
- multiresolution
- databases