Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/CF5C8F6A-5CB9-46F3-BFE8-E6E825C844CB | ||
| Year | 2020 | ||
| Type of Item | Conference Publication | ||
| License |
|
||
| Bibliographic Citation | A. Theodoridis and G. Chalkiadakis, “Monte Carlo Tree Search for the game of diplomacy”, in Hell. Conf. Artif. Intel. SETN, 2020, pp. 16–25, doi: 10.1145/3411408.3411413. https://doi.org/10.1145/3411408.3411413 | ||
| Appears in Collections |
Monte Carlo Tree Search (MCTS) is a decision-making technique that has received considerable interest in the past decade due to its success in a number of domains. In this paper, we explore its application in the “Diplomacy” multi-agent strategic board game, by putting forward and evaluating eight (8) variants of MCTS Diplomacy agents. In the core of our MCTS agents lies the well-known Upper Confidence Bounds for Trees (UCT) bandit method, which attempts to strike a balance between exploration and exploitation during the search tree creation. Moreover, we devised a heuristic weighting system for prioritizing the tree nodes’ actions, and used it to effectively incorporate high-quality domain knowledge in some of our agents. We provide a thorough experimental evaluation of our approach, in which we systematically compare the performance of our agents against each other and against other opponents, including the state-of-the-art Diplomacy agent, DBrane. Our results verify that several of our agents are highly competitive in this domain, exhibiting as they do performance which is comparable to, and in some instances superior to, that of DBrane. Interestingly, the MCTS approach consistently outperforms all others in tournaments in which one MCTS agent faces one D-Brane agent and several other opponents.
Copyright © DIAS 2013
