Building placement optimization in Real-Time Strategy games

5Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

Abstract

In this paper we propose using a Genetic Algorithm to optimize the placement of buildings in Real-Time Strategy games. Candidate solutions are evaluated by running base assault simulations. We present experimental results in Spar-Craft - a StarCraft combat simulator - using battle setups extracted from human and bot StarCraft games. We show that our system is able to turn base assaults that are losses for the defenders into wins, as well as reduce the number of surviving attackers. Performance is heavily dependent on the quality of the prediction of the attacker army composition used for training, and its similarity to the army used for evaluation. These results apply to both human and bot games.

Cite

CITATION STYLE

APA

Barriga, N. A., Stanescu, M., & Buro, M. (2014). Building placement optimization in Real-Time Strategy games. In AAAI Workshop - Technical Report (Vol. WS-14-15, pp. 2–7). AI Access Foundation. https://doi.org/10.1609/aiide.v10i2.12735

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free