How to Make the Perfect Fireworks Display: Two Strategies for Hanabi

@article{Cox2015HowTM,
  title={How to Make the Perfect Fireworks Display: Two Strategies for Hanabi},
  author={Christopher L. Cox and Jessica De Silva and Philip DeOrsey and Franklin Kenter and Troy Retter and Josh Tobin},
  journal={Mathematics Magazine},
  year={2015},
  volume={88},
  pages={323 - 336}
}
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 rely on the actions of the other players to determine information about her cards. This article presents two strategies for Hanabi. These strategies use different encoding schemes, based on ideas from network coding, to efficiently relay information. The first strategy allows players to effectively… 
View on Taylor & Francis
d0474d97-a-62cb3a1a-s-sites.googlegroups.com
36 Citations
Highly Influential Citations
3
Background Citations
19
Methods Citations
5

36 Citations

Citation Type

Citation Type

Hanabi is NP-hard, even for cheaters who look at their cards
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards
TLDR
A simplified mathematical model of a single-player version of the cooperative card game Hanabi is introduced, and several complexity results are shown: the game is intractable in a general setting even if the authors forego with the hidden information aspect of the game.
Playing Hanabi Near-Optimally
TLDR
This study shows that the game of Hanabi, a multi-player cooperative card game in which a player sees the cards of the other players but not his own cards, can be played near-optimally by the computer.
Wait a second: playing Hanabi without giving hints
TLDR
This paper presents Hanabi agents that utilize timing as a covert channel so effectively that they can eschew the communicative actions provided by the game entirely and provides its context in the area of security, and an outlook on how it could be related to human behavior in future work.
Evolving Agents for the Hanabi 2018 CIG Competition
TLDR
A genetic algorithm is developed that builds rule-based agents by determining the best sequence of rules from a fixed rule set to use as strategy and achieves scores superior to previously published research for the mirror and mixed evaluation of agents.
Diverse Agents for Ad-Hoc Cooperation in Hanabi
TLDR
Quality Diversity algorithms are proposed as a promising class of algorithms to generate populations for this purpose and an initial implementation of an agent generator based on this idea is shown.
Aspects of the Cooperative Card Game Hanabi
TLDR
This work examines the cooperative card game Hanabi, shows some combinatorial properties, and develops AI (Artificial Intelligence) players that use rule-based and Monte Carlo methods.
Generating and Adapting to Diverse Ad-Hoc Cooperation Agents in Hanabi
TLDR
Quality Diversity algorithms are proposed as a promising class of algorithms to generate diverse populations for this purpose, and a population of diverse Hanabi agents is generated using MAP-Elites.
Behavioral Evaluation of Hanabi Rainbow DQN Agents and Rule-Based Agents
TLDR
A key finding is that while most agents only learn to play well with partners seen during training, one particular agent leads the Rainbow algorithm towards a much more general policy.
Evaluating the Rainbow DQN Agent in Hanabi with Unseen Partners
TLDR
It is shown that agents trained through self-play using the popular RainbowDQN architecture fail to cooperate well with simple rule-based agents that were not seen during training and, conversely, if agents are trained to play with any individualRule-based agent, or even a mix of these agents, they fail to achieve good self- play scores.
...
...

References

SHOWING 1-10 OF 13 REFERENCES
OPTIMAL STRATEGIES FOR HAT GAMES
TLDR
This paper introduces Ebert’s Hat Game and a variation called ‘Hats-on-a-line’ and introduces a new hat game which is a hybrid of these two and provides an optimal strategy for the new game and presents the combinatorial argument that proves optimality.
Games People Don � t Play
Not all games are to playy some of the most amusing are designed just to think about. Is the game fair? What's the best strategy? The games we describe below w ere collected from various sources by w…
A Dozen Hat Problems
H at problems are all the rage these days, proliferating on various web sites and generating a great deal of conversation-and research-among mathematicians and students. But they have been around for…
Hat Guessing Games
TLDR
This paper considers several variants of the hat guessing problem, united by the common theme that the guessing strategies are required to be deterministic and the objective is to maximize the number of correct answers in the worst case.
Puzzlers' tribute : a feast for the mind
This second collection of interesting mathematical puzzles continues the tribute to Martin Gardner, who has provided us with original puzzles and puzzling stories ever since he created and produced…
Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
TLDR
A special class of Sudoku solutions which the authors call “symmetric” turn out to be related to some important topics in finite geometry over the 3-element field, and to ∗This research partially supported by NSF Grant Number DMS-0510625.
Impossible?: Surprising Solutions to Counterintuitive Conundrums
TLDR
This chapter discusses the paradoxes of Cantor's Paradise, the Banach-Tarski Paradox, Benford's Law, and Goodstein Sequences.
Identification Numbers And Check Digit Schemes
TLDR
The identification numbers and check digit schemes is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can get it instantly.
You can leave your hat on
A dozen hat problems, Math Horizons
  • 2009
...
...