Optimizing UCT for settlers of catan

Gabriel De Arruda Rubin De Lima; Bruno Fortes Paz; Felipe Rech Meneguzzi

doi:10.1109/SBGames.2017.00026

Optimizing UCT for settlers of catan

Gabriel De Arruda Rubin De Lima, Bruno Fortes Paz, Felipe Rech Meneguzzi

Computing Science

Pontifícia Universidade Católica do Rio Grande do Sul

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

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.

Original language	English
Title of host publication	Proceedings - 2017 Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017
Publisher	IEEE Computer Society
Pages	164-172
Number of pages	9
ISBN (Electronic)	9781538648469
DOIs	https://doi.org/10.1109/SBGames.2017.00026
Publication status	Published - 28 Jun 2018
Event	16th Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017 - Curitiba, Brazil Duration: 2 Nov 2017 → 4 Nov 2017

Conference

Conference	16th Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017
Country/Territory	Brazil
City	Curitiba
Period	2/11/17 → 4/11/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Keywords

Artificial Intelligence
Monte Carlo Tree Search
Settlers of Catan

Access to Document

10.1109/SBGames.2017.00026

Cite this

De Arruda Rubin De Lima, G, Fortes Paz, B & Rech Meneguzzi, F 2018, Optimizing UCT for settlers of catan. in Proceedings - 2017 Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017. IEEE Computer Society, pp. 164-172, 16th Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017, Curitiba, Brazil, 2/11/17. https://doi.org/10.1109/SBGames.2017.00026

@inproceedings{43959d15f5c4456ab4d4916efbf09cc9,

title = "Optimizing UCT for settlers of catan",

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.",

keywords = "Artificial Intelligence, Monte Carlo Tree Search, Settlers of Catan",

author = "{De Arruda Rubin De Lima}, Gabriel and {Fortes Paz}, Bruno and {Rech Meneguzzi}, Felipe",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 16th Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017 ; Conference date: 02-11-2017 Through 04-11-2017",

year = "2018",

month = jun,

day = "28",

doi = "10.1109/SBGames.2017.00026",

language = "English",

pages = "164--172",

booktitle = "Proceedings - 2017 Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017",

publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Optimizing UCT for settlers of catan

AU - De Arruda Rubin De Lima, Gabriel

AU - Fortes Paz, Bruno

AU - Rech Meneguzzi, Felipe

PY - 2018/6/28

Y1 - 2018/6/28

N2 - 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.

AB - 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.

KW - Artificial Intelligence

KW - Monte Carlo Tree Search

KW - Settlers of Catan

UR - http://www.scopus.com/inward/record.url?scp=85049986349&partnerID=8YFLogxK

U2 - 10.1109/SBGames.2017.00026

DO - 10.1109/SBGames.2017.00026

M3 - Published conference contribution

AN - SCOPUS:85049986349

SP - 164

EP - 172

BT - Proceedings - 2017 Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017

PB - IEEE Computer Society

T2 - 16th Brazilian Symposium on Computer Games and Digital Entertainment, SBGames 2017

Y2 - 2 November 2017 through 4 November 2017

ER -

Optimizing UCT for settlers of catan

Abstract

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this