The Computational Intelligence of the Game Pac-Man
The Game Pac-Man is a both challengeable and satisfactory video game that has been the focus of some important AI (Artificial Intelligence) research. The goal for using the Game Pac-Man as a test bed in our experiment is that the Pac-Man Game provides a sufficiently rich and challengeable platform for studying the Al in the computer game, and that it is simple enough to permit understanding of its characteristics. In this paper, we use AMAF (AllMoves-As-First) algorithm to manage the search tree for implementing the Pac-Man AI. Moreover, we also introduce the rule-based policy with the domain knowledge to improve the AI of Ghosts (or opponent). Finally, the experimental result from the Game PacMan is presented to demonstrate the effectiveness and efficiency of these algorithms.
Pac-Man Game AI All-Moves-As-First domain knowledge of Pac-Man Game rule-based policy
Bin Wu
School of Software Engineering,Beijing University of Posts and Telecommunications, Beijing, China, 100876
国际会议
北京
英文
619-622
2011-08-24（万方平台首次上网日期，不代表论文的发表时间）