Skip to main content

Aspects of the Cooperative Card Game Hanabi

  • Conference paper
  • First Online:
BNAIC 2016: Artificial Intelligence (BNAIC 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 765))

Included in the following conference series:

Abstract

We examine the cooperative card game Hanabi. Players can only see the cards of the other players, but not their own. Using hints partial information can be revealed. We show some combinatorial properties, and develop AI (Artificial Intelligence) players that use rule-based and Monte Carlo methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baffier, J.-F., Chiu, M.-K., Diez, Y., Korman, M., Mitsou, V., van Renssen, A., Roeloffzen, M., Uno, Y.: Hanabi is NP-complete, even for cheaters who look at their cards. In: Proceedings of 8th International Conference on Fun with Algorithms (FUN 2016), Leibniz International Proceedings in Informatics (LIPIcs) 49, pp. 4:1–4:17 (2016)

    Google Scholar 

  2. van den Bergh, M.J.H.: Hanabi, a cooperative game of fireworks. Bachelor thesis, Leiden University (2015). www.math.leidenuniv.nl/scripties/BSC-vandenBergh.pdf

  3. BoardGameGeek, website. www.boardgamegeek.com. Accessed 3 Oct 2017

  4. Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo Tree Search methods. IEEE Trans. Comput. Intell. AI Games 4, 1–43 (2012)

    Article  Google Scholar 

  5. Cox, C., De Silva, J., Deorsey, P., Kenter, F.H.J., Retter, T., Tobin, J.: How to make the perfect fireworks display: two strategies for Hanabi. Math. Mag. 88, 323–336 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. van Ditmarsch, H., Kooi, B.: One Hundred Prisoners and a Light Bulb. Springer, Switzerland (2015)

    Book  MATH  Google Scholar 

  7. Osawa, H., Hanabi, S.: Estimating hands by opponent’s actions in cooperative game with incomplete information. In: Proceedings of the Workshop at the Twenty-Ninth AAAI Conference on Artificial Intelligence: Computer Poker and Imperfect Information, pp. 37–43 (2015)

    Google Scholar 

  8. R & R Games, website. www.rnrgames.com. Accessed 3 Oct 2017

  9. Ruiz, S.: An algebraic identity leading to Wilson’s theorem. Math. Gaz. 80, 579–582 (1996)

    Article  Google Scholar 

  10. StackExchange, website Sequences that contain subsequence 1,2,3. math.stackexchange.com/questions/1215764/sequences-that-contain-subsequence-1-2-3. Accessed 3 Oct 2017

Download references

Acknowledgements

The authors would like to thank Hendrik Jan Hoogeboom, as well as the anonymous contributors from [10]. Moreover, they thank the reviewers for bringing [5] to our attention.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Walter A. Kosters .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

van den Bergh, M.J.H., Hommelberg, A., Kosters, W.A., Spieksma, F.M. (2017). Aspects of the Cooperative Card Game Hanabi. In: Bosse, T., Bredeweg, B. (eds) BNAIC 2016: Artificial Intelligence. BNAIC 2016. Communications in Computer and Information Science, vol 765. Springer, Cham. https://doi.org/10.1007/978-3-319-67468-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67468-1_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67467-4

  • Online ISBN: 978-3-319-67468-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics