Monte-Carlo tree search in Ms. Pac-Man

2011 IEEE Conference on Computational Intelligence and Games, CIG 2011

Volumn , Issue , 2011, Pages 39-46

  Ikehata, Nozomu ^a   Ito, Takeshi ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GAME; GAME TREES; MONTE CARLO; PERFORMANCE COMPARISON; RANDOM SIMULATION; REAL-TIME GAMES; TREE SEARCH; TREE SEARCH ALGORITHM;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 80054014191     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2011.6031987     Document Type: Conference Paper

References (7)

1. Ms Pac-Man Competition, http://dces.essex.ac.uk/staff/sml/pacman/ PacManContest.html
2. D. Robles and S. Lucas,"A Simple Tree Search Method for Playing Ms. Pac-Man, "IEEE Symposium on Computational Intelligence and Games, pp. 249-255, 2009.
3. R. Coulom, "Efficient selectivity and backup operators in Monte-Calro tree search", Proceedings of the 5th International Conference on Computer and Games, 2006.
4. L.Kocsis and C.Szepesvari,"Bandit based montecarlo planning", European Conference on Machine Learning, pp. 282-293, 2006.
5. Michael Chung, Michael Buro, Jonathan Schaeffer, "Monte Carlo Planning in RTS Games", IEEE Symposium on Computational Intelligence and Games, 2005.
6. R. Balla and A. Fern, "UCT for tactical assault planning in realtime strategy games", Proceedings of International Joint Conference on Artficial Intelligence, pp. 40-45. 2009.
7. R. Thawonmas, H. Matsumoto and T. Ashida, "Ice pambush 3", 2009 IEEE Symposium on Computational Intelligence and Games competition entry. 2009.