AIs for Dominion Using Monte-Carlo Tree Search
Dominion is a complex game, with hidden information and stochastic elements. This makes creating any artificial intelligence (AI) challenging. To this date, there is little work in the literature on AI for Dominion, and existing solutions rely upon carefully tuned finite-state solutions.
This paper presents two novel AIs for Dominion based on Monte-Carlo Tree Search (MCTS) methods. This is achieved by employing Upper Confidence Bounds (UCB) and Upper Confidence Bounds applied to Trees (UCT). The proposed solutions are notably better than existing work. The strongest proposal is able to win 67% of games played against a known, good finite-state solution, even when the finite-state solution has the unfair advantage of starting the game.
KeywordsDominion MCTS UCB UCT
Unable to display preview. Download preview PDF.
- 1.Jansen, J.V., Tollisen, R.: An ai for dominion based on monte-carlo methods (2014)Google Scholar
- 2.Fynbo, R.B., Nellemann, C.: Developing an agent for dominion using modern ai-approaches. Master’s thesis, IT University of Copenhagen (2010)Google Scholar
- 3.Fisher, M.: Provincial: A kingdom-adaptive ai for dominion (2014)Google Scholar
- 4.Chaslot, G.: Monte-Carlo Tree Search. PhD thesis, Maastricht University (2010)Google Scholar
- 7.Gelly, S., Wang, Y.: Exploration exploitation in go: Uct for monte-carlo go (2006)Google Scholar
- 9.Coquelin, P.A., Munos, R.: Bandit algorithms for tree search (2007). arXiv preprint cs/0703062
- 11.Wizards of the Coast. Magic: The Gathering (2013). http://www.wizards.com/Magic/Summoner/ (visited on 05/30/2014)
- 12.GmbH, C.: The official website for the settlers of catan (2014)Google Scholar
- 13.Ward, C.D., Cowling, P.I.: Monte carlo search applied to card selection in magic: the gathering. In: IEEE Symposium on Computational Intelligence and Games, CIG 2009, pp. 9–16. IEEE (2009)Google Scholar