Aspects of the Cooperative Card Game Hanabi
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.
- 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
- 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
- 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