Smooth UCT search in computer poker

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2015-January, Issue , 2015, Pages 554-560

  Heinrich, Johannes ^a   Silver, David ^b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b DEEPMIND   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; TREES (MATHEMATICS);

FICTITIOUS PLAY; IMPERFECT INFORMATION GAMES; MONTE CARLO TREE SEARCH (MCTS); NASH EQUILIBRIA; PERFECT INFORMATIONS; PLANNING PROCESS; TWO-PLAYER GAMES; UPPER CONFIDENCE BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 84949796007     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47(2-3):235-256, 2002.
2. David Auger. Multiple tree for partially observable monte-carlo tree search. In Applications of Evolutionary Computation, pages 53-62. Springer, 2011.
3. Nolan Bard, John Hawkin, Jonathan Rubin, and Martin Zinkevich. The annual computer poker competition. AI Magazine, 34(2):112, 2013.
4. Darse Billings, Aaron Davidson, Jonathan Schaeffer, and Duane Szafron. The challenge of poker. Artificial Intelligence, 134(1):201-240, 2002.
5. Darse Billings, Neil Burch, Aaron Davidson, Robert Holte, Jonathan Schaeffer, Terence Schauenberg, and Duane Szafron. Approximating gametheoretic optimal strategies for full-scale poker. In IJCAI, pages 661-668, 2003.
6. Michael Bowling, Neil Burch, Michael Johanson, and Oskari Tammelin. Heads-up limit holdem poker is solved. Science, 347 (6218):145-149, 2015.
7. George W Brown. Some notes on computation of games solutions. Technical report, DTIC Document, 1949.
8. Cameron B Browne, Edward Powley, Daniel Whitehouse, Simon M Lucas, Peter I Cowling, Philipp Rohlfshagen, Stephen Tavener, Diego Perez, Spyridon Samothrakis, and Simon Colton. A survey of monte carlo tree search methods. Computational Intelligence and AI in Games, IEEE Transactions on, 4(1):1-43, 2012.
9. Neil Burch, Michael Johanson, and Michael Bowling. Solving imperfect information games using decomposition. In Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014.
10. Rémi Coulom. Efficient selectivity and backup operators in monte-carlo tree search. In Computers and games, pages 72-83. Springer, 2007.
11. Peter I Cowling, Edward J Powley, and Daniel Whitehouse. Information set monte carlo tree search. Computational Intelligence and AI in Games, IEEE Transactions on, 4(2):120-143, 2012.
12. Sam Ganzfried and Tuomas Sandholm. Endgame solving in large imperfect-information games. In Proceedings of the Fourteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2015.
13. Sylvain Gelly, Levente Kocsis, Marc Schoenauer, Michèle Sebag, David Silver, Csaba Szepesvári, and Olivier Teytaud. The grand challenge of computer go: Monte carlo tree search and extensions. Communications of the ACM, 55(3):106-113, 2012.
14. Johannes Heinrich and David Silver. Self-play monte-carlo tree search in computer poker. In Workshops at the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014.
15. Michael Johanson, Neil Burch, Richard Valenzano, and Michael Bowling. Evaluating state-space abstractions in extensive-form games. In Proceedings of the Twelfth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2013.
16. Levente Kocsis and Csaba Szepesvári. Bandit based monte-carlo planning. In Machine Learning: ECML 2006, pages 282-293. Springer, 2006.
17. Harold W Kuhn. A simplified two-person poker. Contributions to the Theory of Games, 1:97-103, 1950.
18. Marc Lanctot, Kevin Waugh, Martin Zinkevich, and Michael H Bowling. Monte carlo sampling for regret minimization in extensive games. In NIPS, pages 1078-1086, 2009.
19. Marc Lanctot. Monte Carlo sampling and regret minimization for equilibrium computation and decision-making in large extensive form games. Ph.D. thesis, University of Alberta, 2013.
20. David S Leslie and Edmund J Collins. Generalised weakened fictitious play. Games and Economic Behavior, 56(2):285-298, 2006.
21. Viliam Lisý, Marc Lanctot, and Michael Bowling. Online monte carlo counterfactual regret minimization for search in imperfect information games. In Proceedings of the Fourteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2015.
22. Viliam Lisý. Alternative selection functions for information set monte carlo tree search. Acta Polytechnica: Journal of Advanced Engineering, 54(5):333-340, 2014.
23. Marc Ponsen, Steven de Jong, and Marc Lanctot. Computing approximate nash equilibria and robust best-responses using sampling. Journal of Artificial Intelligence Research, 42(1):575-605, 2011.
24. Tuomas Sandholm. The state of solving large incomplete-information games, and application to poker. AI Magazine, 31(4):13-32, 2010.
25. David Silver and Joel Veness. Monte-carlo planning in large pomdps. In Advances in Neural Information Processing Systems, pages 2164-2172, 2010.
26. Finnegan Southey, Michael Bowling, Bryce Larson, Carmelo Piccione, Neil Burch, Darse Billings, and Chris Rayner. Bayes bluff: Opponent modelling in poker. In In Proceedings of the Twenty-First Annual Conference on Uncertainty in Artificial Intelligence (UAI), 2005.
27. Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione. Regret minimization in games with incomplete information. In Advances in neural information processing systems, pages 1729-1736, 2007.