TY - GEN
T1 - Hanabi is NP-complete, even for cheaters who look at their cards
AU - Baffier, Jean Francois
AU - Chiu, Man Kwun
AU - Diez, Yago
AU - Korman, Matias
AU - Mitsou, Valia
AU - Van Renssen, André
AU - Roeloffzen, Marcel
AU - Uno, Yushi
N1 - Publisher Copyright:
© Jean Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, and Yushi Uno.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2016/6/1
Y1 - 2016/6/1
N2 - This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint. The aim of the game is to play cards from 1 to n in increasing order (this has to be done independently in c different colors). Cards are drawn from a deck one by one. Drawn cards are either immediately played, discarded or stored for future use (overall each player can store up to h cards). 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). We introduce a simplified mathematical model of a single-player version of the game, and show several complexity results: the game is intractable in a general setting even if we forego with the hidden information aspect of the game. On the positive side, the game can be solved in linear time for some interesting restricted cases (i.e., for small values of h and c).
AB - This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint. The aim of the game is to play cards from 1 to n in increasing order (this has to be done independently in c different colors). Cards are drawn from a deck one by one. Drawn cards are either immediately played, discarded or stored for future use (overall each player can store up to h cards). 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). We introduce a simplified mathematical model of a single-player version of the game, and show several complexity results: the game is intractable in a general setting even if we forego with the hidden information aspect of the game. On the positive side, the game can be solved in linear time for some interesting restricted cases (i.e., for small values of h and c).
KW - Algorithmic combinatorial game theory
KW - Sorting
UR - http://www.scopus.com/inward/record.url?scp=84975263324&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84975263324&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.FUN.2016.4
DO - 10.4230/LIPIcs.FUN.2016.4
M3 - Conference contribution
AN - SCOPUS:84975263324
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 8th International Conference on Fun with Algorithms, FUN 2016
A2 - Demaine, Erik D.
A2 - Grandoni, Fabrizio
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 8th International Conference on Fun with Algorithms, FUN 2016
Y2 - 8 June 2016 through 10 June 2016
ER -