Building Placement Optimization in Real-Time Strategy Games

Authors

  • Nicolas Barriga University of Alberta
  • Marius Stanescu University of Alberta
  • Michael Buro University of Alberta

DOI:

https://doi.org/10.1609/aiide.v10i2.12735

Keywords:

Real-time Strategy Games, Genetic Algorithms

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 SparCraft — 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.

Downloads

Published

2021-06-29

How to Cite

Barriga, N., Stanescu, M., & Buro, M. (2021). Building Placement Optimization in Real-Time Strategy Games. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 10(2), 2-7. https://doi.org/10.1609/aiide.v10i2.12735