Fetching the paper…
Reading the bibliography…
This technical report documents the winner of the Computational Intelligence in Games(CIG) 2018 Hanabi competition.
1902
Earlier work this paper cites.
I. Frank and D. Basin, “Search in games with incomplete information: A case study using bridge card play,” Artificial Intelligence , vol. 100, no. 1-2, pp. 87–123, 1998
1998
Earlier work this paper cites.
M. L. Ginsberg, “Gib: Imperfect information in a computationally challenging game,” Journal of Artificial Intelligence Research , vol. 14, pp. 303–358, 2001
2001
Earlier work this paper cites.
L. Kocsis and C. Szepesvári, “Bandit based monte-carlo planning,” in European conference on machine learning . Springer, 2006, pp. 282–293
2006
Earlier work this paper cites.
S. Gelly and D. Silver, “Combining online and offline knowledge in uct,” in Proceedings of the 24th international conference on Machine learning . ACM, 2007, pp. 273–280
2007
Earlier work this paper cites.
G. M. J. Chaslot, M. H. Winands, H. J. V. D. HERIK, J. W. Uiterwijk, and B. Bouzy, “Progressive strategies for monte-carlo tree search,” New Mathematics and Natural Computation , vol. 4, no. 03, pp. 343–357, 2008
2008
Earlier work this paper cites.
M. H. Winands and Y. Björnsson, “Evaluation function based monte-carlo loa,” in Advances in Computer Games . Springer, 2009, pp. 33–44
2009
Earlier work this paper cites.
I. Szita, G. Chaslot, and P. Spronck, “Monte-carlo tree search in settlers of catan,” in Advances in Computer Games . Springer, 2009, pp. 21–32
2009
Earlier work this paper cites.
R. Bjarnason, A. Fern, and P. Tadepalli, “Lower bounding klondike solitaire with monte-carlo planning.” in ICAPS , 2009
2009
Earlier work this paper cites.
M. Buro, J. R. Long, T. Furtak, and N. Sturtevant, “Improving state evaluation, inference, and search in trick-based card games,” in Twenty-First International Joint Conference on Artificial Intelligence , 2009
2009
Earlier work this paper cites.
A. Bauza. (2010) Hanabi. [Online]. Available: "https://boardgamegeek.com/boardgame/98778/hanabi"
2010
Earlier work this paper cites.
D. Silver and J. Veness, “Monte-carlo planning in large pomdps,” in Advances in neural information processing systems , 2010, pp. 2164–2172
2010
Earlier work this paper cites.
S. Ross and D. Bagnell, “Efficient reductions for imitation learning,” in Proceedings of the thirteenth international conference on artificial intelligence and statistics , 2010, pp. 661–668
2010
Earlier work this paper cites.
S. Ross, G. Gordon, and D. Bagnell, “A reduction of imitation learning and structured prediction to no-regret online learning,” in Proceedings of the fourteenth international conference on artificial intelligence and statistics , 2011, pp. 627–635
2011
Cited alongside, same era.
P. I. Cowling, E. J. Powley, and D. Whitehouse, “Information set monte carlo tree search,” IEEE Transactions on Computational Intelligence and AI in Games , vol. 4, no. 2, pp. 120–143, 2012
2012
Cited alongside, same era.
C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton, “A survey of monte carlo tree search methods,” IEEE Transactions on Computational Intelligence and AI in games , vol. 4, no. 1, pp. 1–43, 2012
2012
Cited alongside, same era.
P. I. Cowling, C. D. Ward, and E. J. Powley, “Ensemble determinization in monte carlo tree search for the imperfect information card game magic: The gathering,” IEEE Transactions on Computational Intelligence and AI in Games , vol. 4, no. 4, pp. 241–257, 2012
D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, L. Baker, M. Lai, A. Bolton et al. , “Mastering the game of go without human knowledge,” Nature , vol. 550, no. 7676, p. 354, 2017
2017
Later among the works it cites.
A. Santos, P. A. Santos, and F. S. Melo, “Monte carlo tree search experiments in hearthstone,” in Computational Intelligence and Games (CIG), 2017 IEEE Conference on . IEEE, 2017, pp. 272–279
2017
Later among the works it cites.
B. Bouzy, “Playing hanabi near-optimally,” in Advances in Computer Games . Springer, 2017, pp. 51–62
2017
Later among the works it cites.
J. Walton-Rivers, P. R. Williams, R. Bartle, D. Perez-Liebana, and S. M. Lucas, “Evaluating and modelling hanabi-playing agents,” in Evolutionary Computation (CEC), 2017 IEEE Congress on . IEEE, 2017, pp. 1382–1389
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
P. Nijssen and M. H. Winands, “Monte carlo tree search for the hide-and-seek game Scotland Yard,” IEEE Transactions on Computational Intelligence and AI in Games , vol. 4, no. 4, p. 282–294, 2012
2012
Cited alongside, same era.
——, Hanabi Rulebook . R and R Games, 2014
2014
Cited alongside, same era.
P. I. Cowling, D. Whitehouse, and E. J. Powley, “Emergent bluffing and inference with monte carlo tree search,” in Computational Intelligence and Games (CIG), 2015 IEEE Conference on . IEEE, 2015, pp. 114–121
2015
Cited alongside, same era.
H. Osawa, “Solving hanabi: Estimating hands by opponent’s actions in cooperative game with incomplete information.” in AAAI workshop: Computer Poker and Imperfect Information , 2015, pp. 37–43
2015
Cited alongside, same era.
C. Cox, J. De Silva, P. Deorsey, F. H. Kenter, T. Retter, and J. Tobin, “How to make the perfect fireworks display: Two strategies for hanabi,” Mathematics Magazine , vol. 88, no. 5, pp. 323–336, 2015
2015
Cited alongside, same era.
D. Perez Liebana, J. Dieskau, M. Hunermund, S. Mostaghim, and S. Lucas, “Open loop search for general video game playing,” in Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation . ACM, 2015, pp. 337–344
2015
Cited alongside, same era.
M. J. van den Bergh, A. Hommelberg, W. A. Kosters, and F. M. Spieksma, “Aspects of the cooperative card game hanabi,” in Benelux Conference on Artificial Intelligence . Springer, 2016, pp. 93–105
2016
Cited alongside, same era.
J.-F. Baffier, M.-K. Chiu, Y. Diez, M. Korman, V. Mitsou, A. van Renssen, M. Roeloffzen, and Y. Uno, “Hanabi is np-hard, even for cheaters who look at their cards,” Theoretical Computer Science , vol. 675, pp. 43–55, 2017
2017
Cited alongside, same era.
M. Eger, C. Martens, and M. A. Córdoba, “An intentional ai for hanabi,” in Computational Intelligence and Games (CIG), 2017 IEEE Conference on . IEEE, 2017, pp. 68–75
2017
Later among the works it cites.
T. Anthony, Z. Tian, and D. Barber, “Thinking fast and slow with deep learning and tree search,” in Advances in Neural Information Processing Systems , 2017, pp. 5360–5370
2017
Later among the works it cites.
M. Świechowski, T. Tajmajer, and A. Janusz, “Improving hearthstone ai by combining mcts and supervised learning algorithms,” in Computational Intelligence and Games (CIG), 2018 IEEE Conference on . IEEE, 2018, pp. 445–452
2018
Later among the works it cites.
M. Bitan and S. Kraus, “Combining prediction of human decisions with ismcts in imperfect information games,” in Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems . International Foundation for Autonomous Agents and Multiagent Systems, 2018, pp. 1874–1876
2018
Later among the works it cites.
R. Canaan, H. Shen, R. Torrado, J. Togelius, A. Nealen, and S. Menzel, “Evolving agents for the hanabi 2018 cig competition,” in Computational Intelligence and Games (CIG), 2018 IEEE Conference on . IEEE, 2018, pp. 409–416
2018
Later among the works it cites.
2018
Later among the works it cites.
2019
Closest in time.
A. Bauza. (2010) Forum question on ‘no touch’ hint rule. [Online; accessed 21-Jan-2019]. [Online]. Available: "https://bgg.cc/thread/593999/two-hanabi-rules-questions"
2019
Closest in time.