Experiments with Game Tree Search in Real-Time Strategy Games
Published in
arXiv.org(2012)External Links:
TL
TL;DR
RTMM, a real-time variant of the standard minimax algorithm, is presented and its applicability in the context of RTS games is discussed, its strengths and weaknesses are discussed, and it is evaluated in two real- time games.
Abstract
Game tree search algorithms such as minimax have been used with enormous success in turn-based adversarial games such as Chess or Checkers. However, such algorithms cannot be directly applied to real-time strategy (RTS) games because a number of reasons. For example, minimax assumes a turn-taking game mechanics, not present in RTS games. In this paper we present RTMM, a real-time variant of the standard minimax algorithm, and discuss its applicability in the context of RTS games. We discuss its strengths and weaknesses, and evaluate it in two real-time games.
References15 items
1
Alpha-Beta Pruning for Games with Simultaneous Moves
2
Fast Approximate Max-n Monte Carlo Tree Search for Ms Pac-Man
3
UCT for Tactical Assault Planning in Real-Time Strategy Games
4
Adversarial Planning Through Strategy Simulation
5