著者
Ihara Hiroyuki Imai Shunsuke Oyama Satoshi Kurihara Masahito
出版者
IEEE
巻号頁・発行日
pp.2182-2187, 2018

Artificial intelligence has shown remarkable performance in perfect information games. However, it is still no match for human players when it comes to most imperfect information games. Information set Monte Carlo tree search (ISMCTS) has been developed to reduce the effects of strategy fusion caused by determinization of the imperfect information and demonstrated advantages over the conventional Monte Carlo tree search (MCTS) that uses determinization. Because ISMCTS has only been used for games with relatively simple structure, it is still unknown whether it works effectively for more complex games. In this study, we take Pok´emon as an example of a complex imperfect information game and implement a simulator to evaluate the effectiveness of ISMCTS. Experimental results show that ISMCTS outperforms the conventional MCTS that uses determinization.

言及状況

外部データベース (DOI)

外部データベース (ISBN)

Twitter (3 users, 3 posts, 0 favorites)

https://t.co/R7v07Af9dI
Google scholarで見つけた文献適当に貼っときます。https://t.co/KXp81jxpSM https://t.co/5yJj0CEUaI https://t.co/mpHF9HDZJI https://t.co/8wI0hN0LFK https://t.co/g2FQXv3Bo6 https://t.co/ZNnlgFdft9 https://t.co/Wx6O2FRnK8

収集済み URL リスト