Monte Carlo Tree Search for Love Letter

被引：0

作者：

Omarov, Tamirlan ^{[1
]}

Aslam, Hamna ^{[1
]}

Brown, Joseph Alexander ^{[1
]}

Reading, Elizabeth ^{[1
]}

机构：

[1] Innopolis Univ, Artificial Intelligence Games Dev Lab, Innopolis 420500, Republic Of Tat, Russia

来源：

19TH INTERNATIONAL CONFERENCE ON INTELLIGENT GAMES AND SIMULATION (GAME-ON(R) 2018) | 2018年

关键词：

monte carlo tree search; imperfect information games; determinization; minimax; INFORMATION;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Love Letter is a card game for two to four plavers. Players maintain one card in their hands it all times. For a series of rounds, a player draws a card and then plays one of the two cards in their hand with a goal of knocking out other players from the game by a card effect or by having the highest card at the end of the deck when all the cards have been played. We examined the use of Single Observer Information Set Monte Carlo Tree Search (SO-ISMCTS) in a player agent for a two-player Love Letter, cormpared against a knowledge based agent, Perfect Information Monte Carlo (PINC) and Determinized Minimax and found that none of the algorithm could show the stable results due to game randomness.

引用

页码：10 / 15

页数：6

共 10 条

[1]

[Anonymous], 2014, THESIS

[2]

[Anonymous], 2011, PROC ARTIF INTELL SI

[3] Finite-time analysis of the multiarmed bandit problem [J].

Auer, P ;

Cesa-Bianchi, N ;

Fischer, P .

MACHINE LEARNING, 2002, 47 (2-3) :235-256

[4]

Bjarnason R., 2009, ICAPS

[5] A Survey of Monte Carlo Tree Search Methods [J].

Browne, Cameron B. ;

Powley, Edward ;

Whitehouse, Daniel ;

Lucas, Simon M. ;

Cowling, Peter I. ;

Rohlfshagen, Philipp ;

Tavener, Stephen ;

Perez, Diego ;

Samothrakis, Spyridon ;

Colton, Simon .

IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (01) :1-43

[6] Information Set Monte Carlo Tree Search [J].

Cowling, Peter I. ;

Powley, Edward J. ;

Whitehouse, Daniel .

IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (02) :120-143

[7] Search in games with incomplete information: a case study using Bridge card play [J].

Frank, I ;

Basin, D .

ARTIFICIAL INTELLIGENCE, 1998, 100 (1-2) :87-123

[8] GIB: Imperfect information in a computationally challenging game [J].

Ginsberg, ML .

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2001, 14 :303-358

[9]

Kanai S., 2012, LOVE LETT TEMPEST ED

[10]

Russell StuartJonathan., 2003, ARTIF INTELL, V2

← 1 →