Monte-Carlo tree search in settlers of catan

  • Authors:

  • István Szita;Guillaume Chaslot;Pieter Spronck

  • Affiliations:

  • Department of Knowledge Engineering, Maastricht University;Department of Knowledge Engineering, Maastricht University;Tilburg centre for Creative Computing, Tilburg University

  • Venue:
  • ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Games are considered important benchmark opportunities for artificial intelligence research. Modern strategic board games can typically be played by three or more people, which makes them suitable test beds for investigating multi-player strategic decision making. Monte-Carlo Tree Search (MCTS) is a recently published family of algorithms that achieved successful results with classical, two-player, perfect-information games such as Go. In this paper we apply MCTS to the multi-player, non-deterministic board game Settlers of Catan. We implemented an agent that is able to play against computer-controlled and human players. We show that MCTS can be adapted successfully to multi-agent environments, and present two approaches of providing the agent with a limited amount of domain knowledge. Our results show that the agent has a considerable playing strength when compared to game implementation with existing heuristics. So, we may conclude that MCTS is a suitable tool for achieving a strong Settlers of Catan player.