Skip to search boxSkip to navigationSkip to main content

Novel moving target search algorithms for computer gaming

  • Edmond C. Prakash
    ,
  • Peter K. K. Loh
Research Output: Contribution to journal Article Peer-review

Abstract

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.

Publication Information

Output type

Research Output: Contribution to journal Article Peer-review

Original language

English

Pages from-to (Number of pages)

Pages 1-31

Journal (Volume, Issue Number)

Computers in Entertainment (Volume 7, Issue 2)

Publication milestones

  • Published - 01/06/2009

Publication status

Published - 01/06/2009

ISSN

1544-3574

External Publication IDs

  • handle.net: 10547/223796
  • Scopus: 67949086494

Access to documents

Publication metrics