AIs for Dominion Using Monte-Carlo Tree Search

  • Robin Tollisen
  • Jon Vegard Jansen
  • Morten Goodwin
  • Sondre Glimsdal
Conference paper

DOI: 10.1007/978-3-319-19066-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9101)
Cite this paper as:
Tollisen R., Jansen J.V., Goodwin M., Glimsdal S. (2015) AIs for Dominion Using Monte-Carlo Tree Search. In: Ali M., Kwon Y., Lee CH., Kim J., Kim Y. (eds) Current Approaches in Applied Artificial Intelligence. IEA/AIE 2015. Lecture Notes in Computer Science, vol 9101. Springer, Cham

Abstract

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.

Keywords

Dominion MCTS UCB UCT 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Robin Tollisen
    • 1
  • Jon Vegard Jansen
    • 1
  • Morten Goodwin
    • 1
  • Sondre Glimsdal
    • 1
  1. 1.Department of ICTUniversity of AgderGrimstadNorway

Personalised recommendations