open access

https://hdl.handle.net/2115/72345

Implementation and Evaluation of Information Set Monte Carlo Tree Search for Pokémon

英語

Pokémon

2018

IEEE

2182-2187

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.

会議発表論文

Accepted Manuscript

© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.