Samenvatting
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).
Originele taal-2 | Engels |
---|---|
Titel | 8th International Conference on Fun with Algorithms, FUN 2016 |
Redacteuren | E.D. Demaine, F. Grandoni |
Plaats van productie | Dagstuhl |
Uitgeverij | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Aantal pagina's | 17 |
Volume | 49 |
ISBN van elektronische versie | 9783959770057 |
DOI's | |
Status | Gepubliceerd - 1 jun. 2016 |
Extern gepubliceerd | Ja |
Evenement | 8th International Conference on Fun with Algorithms (FUN 2016) - La Maddalena, Italië Duur: 8 jun. 2016 → 10 jun. 2016 Congresnummer: 8 |
Publicatie series
Naam | Leibniz International Proceedings in Informatics (LIPIcs) |
---|---|
Volume | 49 |
ISSN van geprinte versie | 1868-8969 |
Congres
Congres | 8th International Conference on Fun with Algorithms (FUN 2016) |
---|---|
Verkorte titel | FUN 2016 |
Land/Regio | Italië |
Stad | La Maddalena |
Periode | 8/06/16 → 10/06/16 |