Understanding the success of Perfect Information Monte Carlo sampling in game tree search

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 134-140

  Long, Jeffrey ^a   Sturtevant, Nathan R ^a   Buro, Michael ^a   Furtak, Timothy ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; TREES (MATHEMATICS);

EFFECTIVE APPROACHES; GAME TREE SEARCH; GAME TREES; IMPERFECT INFORMATION GAMES; MONTE CARLO SAMPLING; PERFECT INFORMATIONS;

MONTE CARLO METHODS;

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

References (7)

1. Billings, D.; Burch, N.; Davidson, A.; Holte, R. C; Schaeffer, J.; Schauenberg, T.; and Szafron, D. 2003. Approximating game-theoretic optimal strategies for full-scale poker. In IJCAI, 661-668.
2. Buro, M.; Long, J. R.; Furtak, T.; and Sturtevant, N. R. 2009. Improving state evaluation, inference, and search in trick-based card games. In IJCAI, 1407-1413.
3. Frank, I., and Basin, D. 1998. Search in games with incomplete information: A case study using bridge card play. Artificial Intelligence 87-123.
4. Ginsberg, M. 2001. GIB: Imperfect Information in a Computationally Challenging Game. Journal of Artificial Intelligence Research 303-358.
5. Russell, S., and Norvig, P. 2002. Artificial Intelligence: A Modern Approach. Englewood Cliffs, NJ: Prentice Hall, 2nd edition.
6. Sturtevant, N. R. 2008. An analysis of UCT in multi-player games. In Computers and Games, 37-49.
7. Zinkevich, M.; Johanson, M.; Bowling, M.; and Piccione, C. 2008. Regret Minimization in Games with Incomplete Information. In Advances in Neural Information Processing Systems 20, 1729-1736.