Name
Abstract | ||
|---|---|---|
Settlers of Catan is one of the main representatives of modern strategic board games and there are few autonomous agents available to play it due to its challenging features such as stochasticity, imperfect information, and 4-player structure. In this paper, we extend previous work on UCT search to develop an automated player for Settlers of Catan. Specifically, we develop a move pruning heuristic for this game and introduce the ability to trade with the other players using the UCT algorithm. We empirically compare our new player with a baseline agent for Settlers of Catan as well as the state of the art and show that our algorithm generates superior strategies while taking fewer samples of the game. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/SBGames.2017.00026 | 2017 16th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames) |
Keywords | Field | DocType |
Artificial Intelligence,Monte Carlo Tree Search,Settlers of Catan | Heuristic,Autonomous agent,Computer science,Artificial intelligence,Perfect information,Multimedia | Conference |
ISSN | ISBN | Citations |
2159-6654 | 978-1-5386-4847-6 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gabriel de Arruda Rubin de Lima | 1 | 0 | 0.34 |
| Bruno Fortes Paz | 2 | 0 | 0.34 |
| Felipe Rech Meneguzzi | 3 | 0 | 0.34 |