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

  title={Hanabi is NP-hard, even for cheaters who look at their cards},
  author={Jean-François Baffier and Man-Kwun Chiu and Yago Diez and Matias Korman and Valia Mitsou and Andr{\'e} van Renssen and Marcel Roeloffzen and Yushi Uno},
  journal={Theor. Comput. Sci.},

Figures and Tables from this paper

The Crew: The Quest for Planet Nine is NP-Complete
This work introduces and formally define a perfect-information model of this decision problem deciding whether or not all players can complete their objectives can be solved in polynomial time, and shows that the general unbounded version, as well as the constant player count version are both intractable.
Re-determinizing Information Set Monte Carlo Tree Search in Hanabi
Re-determinizing IS-MCTS is introduced, a novel extension of Information Set Monte Carlo Tree Search (IS-M CTS) that prevents a leakage of hidden information into opponent models that can occur in IS- MCTS, and is particularly severe in Hanabi.
Evaluating and modelling Hanabi-playing agents
This paper implements a number of rule-based agents, both from the literature and of their own devising, in addition to an Information Set-Monte Carlo Tree Search (IS-MCTS) agent, and constructs a new, predictor version that uses a model of the agents with which it is paired.
Game AI Competitions: Motivation for the Imitation Game-Playing Competition
  • M. Swiechowski
  • Computer Science
    2020 15th Conference on Computer Science and Information Systems (FedCSIS)
  • 2020
The goal is to create computer players which can learn and mimic the behavior of particular human players given access to their game records to motivate usefulness of such an approach in various aspects.
L O ] 2 9 M ay 2 01 9 Reachability Games in Dynamic Epistemic Logic
This work defines reachability games based on Dynamic Epistemic Logic (DEL), where the players’ actions are finely described as DEL action models, and establishes several (un)decidability results for the problem of existence of a distributed strategy, depending on the type of actions the players can use.
The 2018 Hanabi competition
The results of the two tracks which formed the 2018 Hanabi competition are presented and the learning track is introduced, a new track for 2019 which allows the agents to collect statistics across multiple games.
Re-determinizing MCTS in Hanabi
  • J. Goodman
  • Computer Science
    2019 IEEE Conference on Games (CoG)
  • 2019
We introduce Re-determinizing IS-MCTS, a novel extension of Information Set Monte Carlo Tree Search (IS-MCTS) that prevents a leakage of hidden information into opponent models that can occur in
Epistemic Planning (Dagstuhl Seminar 17231)
The seminar Epistemic Planning brought together the research communities of Dynamic Epistemic Logic, Knowledge Representation and Reasoning, and Automated Planning to address fundamental problems on
Backgammon is Hard
For the real life setting where the opponent’s strategy and dice rolls are unknown, it is proved that determining whether a player can win is EXPTIME-Hard.


On the Complexity of Trick-Taking Card Games
A general class of perfect information two-player trick-taking card games dealing with arbitrary numbers of hands, suits, and suit lengths is defined and a proof of PSPACE-completeness for a fragment with bounded number of hands is proved through a reduction from Generalized Geography.
The Complexity of Playing Durak
It is proved that, given a generalized durak position, it is PSPACE-complete to decide if a player has a winning strategy and that deciding if an attack can be answered is NP-hard.
How to Make the Perfect Fireworks Display: Two Strategies for Hanabi
Summary The game of Hanabi is a multiplayer cooperative card game that has many similarities to a mathematical “hat guessing game.” In Hanabi, a player does not see the cards in her own hand and must
Solving Hanabi: Estimating Hands by Opponent's Actions in Cooperative Game with Incomplete Information
  • Hirotaka Osawa
  • Computer Science
    AAAI Workshop: Computer Poker and Imperfect Information
  • 2015
The results indicate that the strategy with feedbacks from simulated opponent's viewpoints achieves more score than other strategies.
Bejeweled, Candy Crush and other match-three games are (NP-)hard
This work generalizes this kind of games by only parameterizing the size of the board, while all the other elements (such as the rules or the number of gems) remain unchanged and proves that answering many natural questions regarding such games is actually NP-Hard.
UNO Is Hard, Even for a Single Player
Tetris is hard, even to approximate
It is proved that in the offline version of Tetris, it is -complete to maximize the number of cleared rows, maximize theNumber of tetrises (quadruples of rows simultaneously filled and cleared), minimize the maximum height of an occupied square, or maximize thenumber of pieces placed before the game ends.
Games, puzzles and computation
This thesis develops the idea of game as computation to a greater degree than has been done previously, and presents a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games.
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Background in combinatorial game theory is reviewed, which analyzes ideal play in perfect-information games and results about the complexity of determining ideal play are surveyed, in terms of both polynomial-time algorithms and computational intractability results.
A Combinatorial Problem Which Is Complete in Polynomial Space
It is shown that determining who wins such a game if each player plays perfectly is very hard; this result suggests that the theory of combinational games is difficult.