Document Type

Article

Publication Date

3-2-2011

Abstract

The underlying goal of a competing agent in a discrete real-time strategy (RTS) game is to defeat an adversary. Strategic agents or participants must define an a priori plan to maneuver their resources in order to destroy the adversary and the adversary's resources as well as secure physical regions of the environment. This a priori plan can be generated by leveraging collected historical knowledge about the environment. This knowledge is then employed in the generation of a classification model for real-time decision-making in the RTS domain. The best way to generate a classification model for a complex problem domain depends on the characteristics of the solution space. An experimental method to determine solution space (search landscape) characteristics is through analysis of historical algorithm performance for solving the specific problem. We select a deterministic search technique and a stochastic search method for a priori classification model generation. These approaches are designed, implemented, and tested for a specific complex RTS game, Bos Wars. Their performance allows us to draw various conclusions about applying a competing agent in complex search landscapes associated with RTS games.

Comments

Sourced from the publisher version of record at Hindawi:
Lamont, G. B., Weissgerber, K., Borghetti, B. J., & Peterson, G. L. (2011). Determining solution space characteristics for real-time strategy games and characterizing winning strategies. International Journal of Computer Games Technology, 2011, 834026. https://doi.org/10.1155/2011/834026

Copyright © The authors. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. CC BY 3.0. http://creativecommons.org/licenses/by/3.0/

DOI

10.1155/2011/834026

Source Publication

International Journal of Computer Games Technology

Share

COinS