Monte Carlo Search for Real-Time Strategy Games
- Michael Chung
- Michael Buro
- Jonathan Schaeffer, Department of Computing Science, University of Alberta
Monte Carlo simulations have been successfully used in classic turn–based games such as backgammon, bridge, poker, and Scrabble. In this paper, we apply the ideas to the problem of planning in games with imperfect information, stochasticity, and simultaneous moves. The domain we consider is real–time strategy games. We present a framework—MCPlan—for Monte Carlo planning, identify its performance parameters, and analyze the results of an implementation in a capture– the–flag game
Citation
M. Chung, M. Buro, J. Schaeffer. "Monte Carlo Search for Real-Time Strategy Games". IEEE, pp 117-124, June 2005.| Keywords: | |
| Category: | In Conference |
BibTeX
@incollection{Chung+al:IEEE05,
author = {Michael Chung and Michael Buro and Jonathan Schaeffer},
title = {Monte Carlo Search for Real-Time Strategy Games},
Pages = {117-124},
booktitle = {},
year = 2005,
}Last Updated: June 05, 2007Submitted by Staurt H. Johnson
