Research Repository

A simple tree search method for playing Ms. Pac-Man

Robles, D and Lucas, SM (2009) A simple tree search method for playing Ms. Pac-Man. In: UNSPECIFIED, ? - ?.

Full text not available from this repository.

Abstract

Ms. Pac-Man is a challenging game for software agents that has been the focus of a significant amount of research. This paper describes the current state of a tree-search software agent that will be entered into the IEEE CIG 2009 screen-capture based Ms. Pac-Man software agent competition. While game-tree search is a staple technique for many games, this paper is, perhaps surprisingly, the first attempt we know of to apply it toMs. Pac-Man. The approach we take is to expand a route-tree based on possible moves that the Ms. Pac-Man agent can take to depth 40, and evaluate which path is best using hand-coded heuristics. On a simulator of the game our agent has achieved a high score of 40,000, but only around 15,000 on the original game using a screen-capture interface. Our next steps are focussed on using an improved screen-capture system, and on using evolutionary algorithms to tune the parameters of the agent. ©2009 IEEE.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: CIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 11 Oct 2012 13:11
Last Modified: 23 Jan 2019 02:15
URI: http://repository.essex.ac.uk/id/eprint/4048

Actions (login required)

View Item View Item