Applying Monte-Carlo Tree Search to collaboratively controlling of a Ghost Team in Ms Pac-Man

We present an application of Monte-Carlo Tree Search (MCTS) to controlling ghosts in the game of Ms Pac-Man. We approach the problem by performing MCTS on each ghost's tree that represents the game state from the ghost's perspective. Our goal is to create a strong ghost team that is adaptable to a variety of Ms Pac-Man's play styles. This ghost team (ICE gUCT) won the CEC 2011 Ms Pac-Man vs Ghost Team Competition for the ghost side.

[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]  Chi Wan Sung,et al.  A Monte-Carlo approach for ghost avoidance in the Ms. Pac-Man game , 2010, 2010 2nd International IEEE Consumer Electronics Society's Games Innovations Conference.

[3]  Guillaume Maurice Jean-Bernard Chaslot Chaslot,et al.  Monte-Carlo Tree Search , 2010 .

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

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