Abstract
In this paper, we explore the possibility of search-based agents in games with resource-intensive forward models. We implemented a player agent in the Pommerman framework and put it against the baseline agent to measure its performance. We implemented a heuristic agent and improved it by enabling depth-limited tree search in specific gameplay moments. We also compared different node selection methods during depth-limited tree search. Our result shows that depth-limited tree search is still viable when presented with inefficient forward models and exploitation-driven selection method is the most efficient in this specific domain.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018 |
Editors | Sebastian Deterding, Mitu Khandaker, Sebastian Risi, Jose Font, Steve Dahlskog, Christoph Salge, Carl Magnus Olsson |
Publisher | Association for Computing Machinery |
ISBN (Electronic) | 9781450365710 |
DOIs | |
State | Published - Aug 7 2018 |
Event | 13th International Conference on the Foundations of Digital Games, FDG 2018 - Malmo, Sweden Duration: Aug 7 2018 → Aug 10 2018 |
Publication series
Name | ACM International Conference Proceeding Series |
---|
Other
Other | 13th International Conference on the Foundations of Digital Games, FDG 2018 |
---|---|
Country/Territory | Sweden |
City | Malmo |
Period | 8/7/18 → 8/10/18 |
Keywords
- Monte carlo methods
- Pommerman
- State machines
- Tree search
ASJC Scopus subject areas
- Software
- Human-Computer Interaction
- Computer Vision and Pattern Recognition
- Computer Networks and Communications