Evolving robust strategies for an abstract real-time strategy game

David Keaveney, Colm O'Riordan

Research output: Chapter in Book or Conference Publication/ProceedingConference Publicationpeer-review

15 Citations (Scopus)

Abstract

This paper presents an analysis of evolved strategies for an abstract real-time strategy (RTS) game. The abstract RTS game used is a turn-based strategy game with properties such as parallel turns and imperfect spatial information. The automated player used to learn strategies uses a progressive refinement planning technique to plan its next immediate turn during the game. We describe two types of spatial tactical coordination which we posit are important in the game and define measures for both. A set of ten strategies evolved in a single environment are compared to a second set of ten strategies evolved across a set of environments. The robustness of all of evolved strategies are assessed when playing each other in each environment. Also, the levels of coordination present in both sets of strategies are measured and compared. We wish to show that evolving across multiple spatial environments is necessary to evolve robustness into our strategies.

Original languageEnglish
Title of host publicationCIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games
Pages371-378
Number of pages8
DOIs
Publication statusPublished - 2009
EventCIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games - Milano, Italy
Duration: 7 Sep 200910 Sep 2009

Publication series

NameCIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games

Conference

ConferenceCIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games
Country/TerritoryItaly
CityMilano
Period7/09/0910/09/09

Keywords

  • Coordination
  • Generalisability
  • Genetic programming
  • Real-time strategy

Fingerprint

Dive into the research topics of 'Evolving robust strategies for an abstract real-time strategy game'. Together they form a unique fingerprint.

Cite this