International Journal of Computer Games Technology 
Volume 2009 (2009), Article ID 745219, 6 pages
doi:10.1155/2009/745219
Research Article

Performance Simulations of Moving Target Search Algorithms

Peter K. K. Loh1 and Edmond C. Prakash2

 1Division of Computer Science, School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, 639798, Singapore
2Department of Computing and Mathematics, Manchester Metropolitan University, Chester Street, Manchester M1 5GD, UK
Received 9 April 2008; Revised 9 July 2008; Accepted 25 September 2008

Recommended by Kok Wai Wong

Abstract

The design of appropriate moving target search (MTS) algorithms for computer-generated bots poses serious challenges as they have to satisfy stringent requirements that include computation and execution efficiency. In this paper, we investigate the performance and behaviour of existing moving target search algorithms when applied to search-and-capture gaming scenarios. As part of the investigation, we also introduce a novel algorithm known as abstraction MTS. We conduct performance simulations with a game bot and moving target within randomly generated mazes of increasing sizes and reveal that abstraction MTS exhibits competitive performance even with large problem spaces.