Modern game playing programs use opening books in order to perform better. Generating opening books automatically in combination with an αβ program has been well studied. A challenge is to generate automatically an opening book for the new Monte-Carlo Tree Search (MCTS) algorithms. In this article, we tackle this issue by combining two level of MCTS. The resulting algorithm is called Meta-MCTS. Instead of applying a simulation strategy, it uses an MCTS program to play a simulated game. We describe two Meta-MCTS algorithms: the first one, Quasi Best-First, favors exploitation. The second one, Beta Distribution Sampling, favors exploration. Our approach is generic and can be used for general game playing. Itwill be particularly usefulwhen there is off-line time avail- able. In order to evaluate the performances of these algorithms, we generated and tested 99 Go opening books.
|Number of pages||6|
|Publication status||Published - 2009|
|Event|| IJCAI'09 Workshop on General Intelligence in Game Playing Agents - |
Duration: 12 Jul 2009 → …
|Conference||IJCAI'09 Workshop on General Intelligence in Game Playing Agents|
|Period||12/07/09 → …|
Chaslot, G. M. J-B., Hoock, J-B., Perez, J., Rimmel, A., Teytaud, O., & Winands, M. H. M. (2009). Meta Monte-Carlo Tree Search for Automatic Opening Book Generation. 7-12. Paper presented at IJCAI'09 Workshop on General Intelligence in Game Playing Agents, . http://www.personeel.unimaas.nl/M-Winands/documents/ouvertures9x9.pdf