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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)
186 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Hanabi is NP-complete, even for cheaters who look at their cards'. Together they form a unique fingerprint.

Mathematics

Computer Science