Files and links (1)
Preprint (Author's original)arXiv.org - Non-exclusive license to distribute, Open
Preprint
Experiments with Game Tree Search in Real-Time Strategy Games
arXiv.org
09 Aug 2012
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.
Metrics
1 Record Views
Details
- Title
- Experiments with Game Tree Search in Real-Time Strategy Games
- Creators
- Santiago Ontanon - Drexel University
- Publication Details
- arXiv.org
- Resource Type
- Preprint
- Language
- English
- Academic Unit
- Computer Science (Computing)
- Other Identifier
- 991021869011004721