Analysis of rule based look-ahead strategy using Pacman testbed

Games may be used as a test-bed for the analysis of the working of any innovative idea that lies in the field of computational or artificial intelligence. There are three general categories of such games; board games (e.g. tic-tac toe, checkers, Othello), video games (e.g. Dead-end, Cellz, Flatland, Pacman, Nero) and robotics. We have implemented a test-bed of Pacman game in C# and applied various strategies to Pacman agent. The fitness of a strategy depends upon two factors; maximum survival of the Pacman player and swallowed pallets. Experimental results favors rule based look-ahead mechanism over random, greedy and rule based with greed approaches.