> Detailanzeige

Baffier, Jean-Francois [VerfasserIn]; Chiu, Man-Kwun [VerfasserIn]; Diez, Yago [VerfasserIn]; Korman, Matias [VerfasserIn]; Mitsou, Valia [VerfasserIn]; van Renssen, André [VerfasserIn]; Roeloffzen, Marcel [VerfasserIn]; Uno, Yushi [VerfasserIn] ; Jean-Francois Baffier and Man-Kwun Chiu and Yago Diez and Matias Korman and Valia Mitsou and André van Renssen and Marcel Roeloffzen and Yushi Uno [MitwirkendeR]

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards

Literatur-
verwaltung

Zur
Merkliste

Lösche von
Merkliste

Per Whatsapp teilen

Schließen

Merkliste



Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
  • Medientyp: Sonstige Veröffentlichung; E-Artikel; Elektronischer Konferenzbericht
  • Titel: Hanabi is NP-complete, Even for Cheaters who Look at Their Cards
  • Beteiligte: Baffier, Jean-Francois [VerfasserIn]; Chiu, Man-Kwun [VerfasserIn]; Diez, Yago [VerfasserIn]; Korman, Matias [VerfasserIn]; Mitsou, Valia [VerfasserIn]; van Renssen, André [VerfasserIn]; Roeloffzen, Marcel [VerfasserIn]; Uno, Yushi [VerfasserIn]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/LIPIcs.FUN.2016.4
  • Schlagwörter: sorting ; algorithmic combinatorial game theory
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: 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).
  • Zugangsstatus: Freier Zugang