Manchester Metropolitan University's Research Repository

    Novel moving target search algorithms for computer gaming

    Loh, Peter K. K. and Prakash, Edmond C. (2009) Novel moving target search algorithms for computer gaming. Computers in Entertainment, 7 (2). pp. 1-16. ISSN 1544-3981

    File not available for download.


    In a computer game, equipping a bot with a suitable algorithm to locate a human player is difficult. Besides the unpredictable moves made by the player, an unexplored map region poses additional constraints such as new obstacles and pathways that the bot needs to discover quickly. The design criteria of such moving target search (MTS) algorithms would typically need to consider computation efficiency and storage requirements. That is, the bot must appear to be “smart” and “quick” in order to enhance the playability and challenge posed by the game. These criteria, however, pose conflicting requirements. In this article, we study and evaluate the performance and behavior of two novel MTS algorithms, Fuzzy MTS and Abstraction MTS, against existing MTS algorithms in randomly generated mazes of increasing size. Simulations reveal that Fuzzy MTS and Abstraction MTS exhibit competitive performance even with large problem spaces.

    Impact and Reach


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics for this dataset are available via IRStats2.


    Repository staff only

    Edit record Edit record