Filters








2 Hits in 4.1 sec

Hanabi is NP-hard, Even for Cheaters who Look at Their Cards [article]

Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
2017 arXiv   pre-print
In Hanabi, each card has one among $c$ colors and a number between $1$ and $n$. The aim is to make, for each color, a pile of cards of that color with all increasing numbers from $1$ to $n$.  ...  One of the features of the game is that the players can see their partners' cards but not their own and information must be shared through hints.  ...  Acknowledgements The authors would like to thank Erik Demaine for some insightful comments on the problem.  ... 
arXiv:1603.01911v3 fatcat:7cto24av3jh4vfojmewgnui4ii

Hanabi is NP-Complete, Even for Cheaters Who Look at Their Cards

Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André Van Renssen, Marcel Roeloffzen, Yushi Uno, Jean, Francois Baffier, Man-Kwun Chiu, Yago Diez (+5 others)
2016 17 Leibniz International Proceedings in Informatics Schloss Dagstuhl-Leibniz-Zentrum für Informatik   unpublished
The main feature of the game is that players know the cards their partners hold (but not theirs. This information must be shared through hints).  ...  This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint.  ...  Unfortunately the problem is NP-complete, even if 4:4 Hanabi is NP-Complete, Even for Cheaters Who Look at Their Cards we fix some parameters to be small constants.  ... 
fatcat:6b4nt44rc5dgtl2clopstxjg5a