Hanabi is NP-complete, even for cheaters who look at their cards

Baffier, J-F and Chiu, M-K and Diez, Y and Korman, M and Mitsou, Valia (2016) Hanabi is NP-complete, even for cheaters who look at their cards. In: 8th International Conference on Fun with Algorithms, FUN 2016. Leibniz International Proceedings in Informatics, LIPIcs (49). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 4:1-4:17. ISBN 9783959770057 10.4230/LIPIcs.FUN.2016.4

[img] Text
Baffier_4_3173858_ny.pdf

Download (572kB)
Item Type: Book Section
Uncontrolled Keywords: Game theory; Simplified mathematical model; Positive sides; NP Complete; Linear time; Hidden information; Complexity results; Combinatorial game theory; Card games; Combinatorial mathematics; Algorithms; Sorting; Algorithmic combinatorial game theory
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 29 Jan 2017 20:30
Last Modified: 29 Jan 2017 20:30
URI: http://eprints.sztaki.hu/id/eprint/9037

Update Item Update Item