Samothrakis, Spyridon and Robles, David and Lucas, Simon (2011) 'Fast Approximate Max-n Monte Carlo Tree Search for Ms Pac-Man.' IEEE Transactions on Computational Intelligence and AI in Games, 3 (2). pp. 142-154. ISSN 1943-068X
|
Text
MontePacTCIAIG.pdf - Draft Version Download (914kB) | Preview |
Abstract
We present an application of Monte Carlo tree search (MCTS) for the game of Ms Pac-Man. Contrary to most applications of MCTS to date, Ms Pac-Man requires almost real-time decision making and does not have a natural end state. We approached the problem by performing Monte Carlo tree searches on a five player maxn tree representation of the game with limited tree search depth. We performed a number of experiments using both the MCTS game agents (for pacman and ghosts) and agents used in previous work (for ghosts). Performance-wise, our approach gets excellent scores, outperforming previous non-MCTS opponent approaches to the game by up to two orders of magnitude. © 2011 IEEE.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Max-n; Monte Carlo; Monte Carlo tree search (MCTS); Pac-Man |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
SWORD Depositor: | Elements |
Depositing User: | Elements |
Date Deposited: | 19 Oct 2012 15:44 |
Last Modified: | 15 Jan 2022 00:35 |
URI: | http://repository.essex.ac.uk/id/eprint/4111 |
Actions (login required)
![]() |
View Item |