Dissertation
Adversarial search and spatial reasoning in real time strategy games
Doctor of Philosophy (Ph.D.), Drexel University
May 2017
DOI:
https://doi.org/10.17918/etd-7346
Abstract
For many years, Chess was the standard game to test new Artificial Intelligence (AI) algorithms for achieving robust game-playing agents capable of defeating the best human players. Nowadays, games like Go or Poker are used since they offer new challenges like larger state spaces, or non-determinism. Among these testbed games, Real-Time Strategy (RTS) games have raised as one of the most challenging. The unique properties of RTS games (simultaneous and durative actions, large state spaces, partial observability) make them a perfect scenario to test algorithms able to make decisions in dynamic and complex situations. This thesis makes a contribution towards achieving human-level AI in these complex games. Specifically, I focus on the problems of performing adversarial search in domains (1) with extremely large decision and state spaces, (2) where no forward model is available, and (3) the game state is partially observable. Additionally, I also study how spatial reasoning can be used to reduce the search space and to improve the RTS playing bots.
Metrics
92 File views/ downloads
82 Record Views
Details
- Title
- Adversarial search and spatial reasoning in real time strategy games
- Creators
- Alberto Uriarte - DU
- Contributors
- Santiago Ontañón (Advisor) - Drexel University (1970-)
- Awarding Institution
- Drexel University
- Degree Awarded
- Doctor of Philosophy (Ph.D.)
- Publisher
- Drexel University; Philadelphia, Pennsylvania
- Number of pages
- xi, 162 pages
- Resource Type
- Dissertation
- Language
- English
- Academic Unit
- Computer Science (Computing) (2013-2026); College of Computing and Informatics (2013-2026); Drexel University
- Other Identifier
- 7346; 991014632441504721