Time Management for Monte-Carlo Tree Search Applied to the Game of Go

被引：5

作者：

Huang, Shih-Chieh ^{[1
]}

Coulom, Remi ^{[2
]}

Lin, Shun-Shii ^{[1
]}

机构：

[1] Natl Taiwan Normal Univ, Dept CSIE, Taipei, Taiwan

[2] Univ Lille, INRIA, CNRS, Lille, France

来源：

INTERNATIONAL CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI 2010) | 2010年

关键词：

Monte-Carlo tree search; game of Go; time management;

D O I：

10.1109/TAAI.2010.78

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Monte-Carlo tree search (MCTS) is a new technique that has produced a huge leap forward in the strength of Go-playing programs. An interesting aspect of MCTS that has been rarely studied in the past is the problem of time management. This paper presents the effect on playing strength of a variety of time-management heuristics for 19 x 19 Go. Results indicate that clever time management can have a very significant effect on playing strength. Experiments demonstrate that the most basic algorithm for sudden-death time controls (dividing the remaining time by a constant) produces a winning rate of 43.2 +/- 2.2% against GNU Go 3.8 Level 2, whereas our most efficient time-allocation strategy can reach a winning rate of 60 +/- 2.2% without pondering and 67.4 +/- 2.1% with pondering.

引用

页码：462 / 466

页数：5

共 50 条

[1] Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go
Fernando, Sumudu
Mueller, Martin
[J]. COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 72 - 83
[2] Towards Generalizing the Success of Monte-Carlo Tree Search beyond the Game of Go
Gusmao, Antonio
Raiko, Tapani
[J]. 20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 384 - 389
[3] LinUCB Applied to Monte-Carlo Tree Search
Mandai, Yusaku
Kaneko, Tomoyuki
[J]. ADVANCES IN COMPUTER GAMES, ACG 2015, 2015, 9525 : 41 - 52
[4] Monte-Carlo Tree Search Parallelisation for Computer Go
van Niekerk, Francois
Kroon, Steve
van Rooyen, Gert-Jan
Inggs, Cornelia P.
[J]. PROCEEDINGS OF THE SOUTH AFRICAN INSTITUTE FOR COMPUTER SCIENTISTS AND INFORMATION TECHNOLOGISTS CONFERENCE, 2012, : 129 - 138
[5] EXPERIMENTS WITH MONTE-CARLO TREE SEARCH IN THE GAME OF HAVANNAH
Lorentz, Richard J.
[J]. ICGA JOURNAL, 2011, 34 (03) : 140 - 149
[6] Monte-Carlo Tree Search for the Game of Scotland Yard
Nijssen, J. A. M.
Winands, Mark H. M.
[J]. 2011 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG), 2011, : 158 - 165
[7] Backpropagation Modification in Monte-Carlo Game Tree Search
Xie, Fan
Liu, Zhiqing
[J]. 2009 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION, VOL 2, PROCEEDINGS, 2009, : 125 - 128
[8] Application of Monte-Carlo Tree Search in Tsumego of Computer Go
Wang, Fang
Peng, Ying
[J]. MEASUREMENT TECHNOLOGY AND ITS APPLICATION, PTS 1 AND 2, 2013, 239-240 : 1344 - 1347
[9] Monte-Carlo Tree Search for the Game of "7Wonders"
Robilliard, Denis
Fonlupt, Cyril
Teytaud, Fabien
[J]. COMPUTER GAMES, CGW 2014, 2014, 504 : 64 - 77
[10] Application of Monte-Carlo Tree Search in a Fighting Game AI
Yoshida, Shubu
Ishihara, Makoto
Miyazaki, Taichi
Nakagawa, Yuto
Harada, Tomohiro
Thawonmas, Ruck
[J]. 2016 IEEE 5TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS, 2016,

← 1 2 3 4 5 →