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

Baffier, Jean Francois; Chiu, Man Kwun; Diéz, Yago; Korman, Matias; Mitsou, Valia; Renssen, André van; Roeloffzen, Marcel; Uno, Yushi

doi:10.1016/j.tcs.2017.02.024

Cited by 15 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been many research papers published on Hanabi as a game and agents for playing the game. Some mathematical analysis of the game has been conducted, and the game has been shown to be NP-Complete by Baffier, Chiu, Diez, et al [5], this is also the case if all hidden information is removed.…”

Section: Recent Research a Hanabimentioning

confidence: 99%

See 1 more Smart Citation

The 2018 Hanabi competition

Walton-Rivers

Williams

Bartle

2019

2019 IEEE Conference on Games (CoG)

View full text Add to dashboard Cite

This paper outlines the Hanabi competition, first run at CIG 2018, and returning for COG 2019. Hanabi presents a useful domain for game agents which must function in a cooperative environment. The paper presents the results of the two tracks which formed the 2018 competition and introduces the learning track, a new track for 2019 which allows the agents to collect statistics across multiple games.

show abstract

Section: Recent Research a Hanabimentioning

confidence: 99%

“…The objective of the game is for the players to form sets of cards of each suit, in rank order from the lowest value (1) to the highest value (5). For completing a suit, the players also get an additional information token (if they have less than the maximum 8 tokens).…”

Section: Domain Descriptionmentioning

confidence: 99%

The 2018 Hanabi competition

Walton-Rivers

Williams

Bartle

2019

2019 IEEE Conference on Games (CoG)

View full text Add to dashboard Cite

show abstract

“…Optimal play of (generalized) Hanabi has been proven to be an NP-Complete problem by Baffier et al [8], even if we remove all hidden information. Due to this complexity, most research in Hanabi-playing agents [5], [9]- [11] focuses on one of two methods (or a combination of both):…”

Section: Related Workmentioning

confidence: 99%

Evolving Agents for the Hanabi 2018 CIG Competition

Canaan

Shen

Torrado

et al. 2018

2018 IEEE Conference on Computational Intelligence and Games (CIG)

View full text Add to dashboard Cite

Hanabi is a cooperative card game with hidden information that has won important awards in the industry and received some recent academic attention. A two-track competition of agents for the game will take place in the 2018 CIG conference. In this paper, we develop a genetic algorithm that builds rulebased agents by determining the best sequence of rules from a fixed rule set to use as strategy. In three separate experiments, we remove human assumptions regarding the ordering of rules, add new, more expressive rules to the rule set and independently evolve agents specialized at specific game sizes. As result, we achieve scores superior to previously published research for the mirror and mixed evaluation of agents.

show abstract

“…This is a source of complexity for agents, because imperfect information needs to be reasoned about intelligently. Note that Hanabi has been proven to be NP-Complete even when players have perfect information [2].…”

Section: Introductionmentioning

confidence: 99%

Evaluating and modelling Hanabi-playing agents

Walton-Rivers

Williams

Bartle

et al. 2017

2017 IEEE Congress on Evolutionary Computation (CEC)

View full text Add to dashboard Cite

Agent modelling involves considering how other agents will behave, in order to influence your own actions. In this paper, we explore the use of agent modelling in the hiddeninformation, collaborative card game Hanabi. We implement a number of rule-based agents, both from the literature and of our own devising, in addition to an Information Set-Monte Carlo Tree Search (IS-MCTS) agent. We observe poor results from IS-MCTS, so construct a new, predictor version that uses a model of the agents with which it is paired. We observe a significant improvement in game-playing strength from this agent in comparison to IS-MCTS, resulting from its consideration of what the other agents in a game would do. In addition, we create a flawed rule-based agent to highlight the predictor's capabilities with such an agent.

show abstract

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

Cited by 15 publications

References 6 publications

The 2018 Hanabi competition

The 2018 Hanabi competition

Evolving Agents for the Hanabi 2018 CIG Competition

Evaluating and modelling Hanabi-playing agents

Contact Info

Product

Resources

About