Application of Monte-Carlo Tree Search in a Fighting Game AI

被引：0

作者：

Yoshida, Shubu ^{[1
]}

Ishihara, Makoto ^{[2
]}

Miyazaki, Taichi ^{[1
]}

Nakagawa, Yuto ^{[2
]}

Harada, Tomohiro ^{[1
]}

Thawonmas, Ruck ^{[1
]}

机构：

[1] Ritsumeikan Univ, Coll Informat Sci & Engn, Intelligent Comp Entertainment Lab, Kyoto, Shiga, Japan

[2] Ritsumeikan Univ, Grad Sch Informat Sci & Engn, Kyoto, Shiga, Japan

来源：

2016 IEEE 5TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS | 2016年

关键词：

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper describes an application of Monte-Carlo Tree Search (MCTS) in a lighting game AI. MCTS is a best first search technique that uses stochastic simulations. In this paper, we evaluate its effectiveness on FightingICE, a game AI competition platform at Computational Intelligence and Games Conferences. Our results confirm that MCTS is an effective search for controlling a game AI in the aforementioned platform.

引用

页数：2

共 50 条

[21] Monte-Carlo Tree Search for Constrained POMDPs
Lee, Jongmin
Kim, Geon-Hyeong
Poupart, Pascal
Kim, Kee-Eung
[J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
[22] Monte-Carlo Tree Search in Settlers of Catan
Szita, Istvan
Chaslot, Guillaume
Spronck, Pieter
[J]. ADVANCES IN COMPUTER GAMES, 2010, 6048 : 21 - +
[23] A Parallel Monte-Carlo Tree Search Algorithm
Cazenave, Tristan
Jouandeau, Nicolas
[J]. COMPUTERS AND GAMES, 2008, 5131 : 72 - 80
[24] LinUCB Applied to Monte-Carlo Tree Search
Mandai, Yusaku
Kaneko, Tomoyuki
[J]. ADVANCES IN COMPUTER GAMES, ACG 2015, 2015, 9525 : 41 - 52
[25] PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
Chaslot, Guillaume M. J-B.
Winands, Mark H. M.
Van den Herik, H. Jaap
Uiterwijk, Jos W. H. M.
Bouzy, Bruno
[J]. NEW MATHEMATICS AND NATURAL COMPUTATION, 2008, 4 (03) : 343 - 357
[26] Monte-Carlo Tree Search for Policy Optimization
Ma, Xiaobai
Driggs-Campbell, Katherine
Zhang, Zongzhang
Kochenderfer, Mykel J.
[J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 3116 - 3122
[27] Scalability and Parallelization of Monte-Carlo Tree Search
Bourki, Amine
Chaslot, Guillaume
Coulm, Matthieu
Danjean, Vincent
Doghmen, Hassen
Hoock, Jean-Baptiste
Herault, Thomas
Rimmel, Arpad
Teytaud, Fabien
Teytaud, Olivier
Vayssiere, Paul
Yu, Ziqin
[J]. COMPUTERS AND GAMES, 2011, 6515 : 48 - 58
[28] Improving Monte-Carlo Tree Search in Havannah
Lorentz, Richard J.
[J]. COMPUTERS AND GAMES, 2011, 6515 : 105 - 115
[29] Score Bounded Monte-Carlo Tree Search
Cazenave, Tristan
Saffidine, Abdallah
[J]. COMPUTERS AND GAMES, 2011, 6515 : 93 - 104
[30] The Multiple Uses of Monte-Carlo Tree Search
Senington, Richard
[J]. SPS 2022, 2022, 21 : 713 - 724

← 1 2 3 4 5 →