Monte Carlo Tree Search for Collaboration Control of Ghosts in Ms. Pac-Man

In this paper, we present an application of Monte Carlo tree search (MCTS) to control ghosts in the game called Ms. Pac-Man. Our proposed ghost team consists of a ghost controlled by rules and three ghosts controlled individually by different MCTS. Given a limited time response, in order to increase the reliability of MCTS results, we introduce a mechanism for predicting Ms. Pac-Man's future movements and use this mechanism for simulating Ms. Pac-Man during Monte Carlo simulations. Our ghost team won the first Ms. Pac-Man Versus Ghost Team Competition at the 2011 IEEE Congress on Evolutionary Computation (CEC). Its performances for a variety of design choices are also shown and discussed.

[1]  Simon M. Lucas,et al.  Fast Approximate Max-n Monte Carlo Tree Search for Ms Pac-Man , 2011, IEEE Transactions on Computational Intelligence and AI in Games.

[2]  Yngvi Björnsson,et al.  CadiaPlayer: A Simulation-Based General Game Player , 2009, IEEE Transactions on Computational Intelligence and AI in Games.

[3]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[4]  Shang-Rong Tsai,et al.  Current Frontiers in Computer Go , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[5]  Peter I. Cowling,et al.  Determinization and information set Monte Carlo Tree Search for the card game Dou Di Zhu , 2011, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11).

[6]  Luigi Barone,et al.  Using NEAT for continuous adaptation and teamwork formation in Pacman , 2008, 2008 IEEE Symposium On Computational Intelligence and Games.

[7]  Mark H. M. Winands,et al.  Monte-Carlo Tree Search for the game of Scotland Yard , 2011, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11).

[8]  Simon M. Lucas,et al.  Learning non-random moves for playing Othello: Improving Monte Carlo Tree Search , 2011, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11).

[9]  Simon M. Lucas,et al.  Ms Pac-Man versus Ghost Team CEC 2011 competition , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[10]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[11]  Risto Miikkulainen,et al.  Evolving Neural Networks through Augmenting Topologies , 2002, Evolutionary Computation.

[12]  Rémi Coulom,et al.  Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.

[13]  Alan Fern,et al.  UCT for Tactical Assault Planning in Real-Time Strategy Games , 2009, IJCAI.

[14]  Shi-Jim Yen,et al.  Two-Stage Monte Carlo Tree Search for Connect6 , 2011, IEEE Transactions on Computational Intelligence and AI in Games.

[15]  Nataliya Sokolovska,et al.  Continuous Upper Confidence Trees , 2011, LION.

[16]  Mark H. M. Winands,et al.  Monte Carlo Tree Search in Lines of Action , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[17]  Georgios N. Yannakakis,et al.  A Generic Approach for Generating Interesting Interactive Pac-Man Opponents , 2005, CIG.

[18]  Branislav Bosanský,et al.  Anytime algorithms for multi-agent visibility-based pursuit-evasion games , 2012, AAMAS.

[19]  Richard J. Lorentz.  Amazons Discover Monte-Carlo , 2008, Computers and Games.

[20]  Takeshi Ito,et al.  Monte-Carlo tree search in Ms. Pac-Man , 2011, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11).

[21]  Pieter Spronck,et al.  Monte-Carlo Tree Search: A New Framework for Game AI , 2008, AIIDE.

[22]  Ryan B. Hayward,et al.  Monte Carlo Tree Search in Hex , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[23]  Nathan R. Sturtevant,et al.  An Analysis of UCT in Multi-Player Games , 2008, J. Int. Comput. Games Assoc..