Do evaluation functions really improve Monte-Carlo tree search?

Subtitle: Empirical analysis using Othello

Article type: Research Article

Authors: Matsuzaki, Kiminori^{; *} | Kitamura, Naoki

Affiliations: School of Information, Kochi University of Technology, Kami, Kochi, Japan

Correspondence: [*] Corresponding author. E-mail: [email protected].

Abstract: Monte-Carlo tree search (MCTS) algorithms play an important role in developing computer players, especially for games for which good evaluation functions are hard to obtain, like Go. The performance of MCTS players is often leveraged in combination with online and/or offline knowledge, despite the lack of game-theoretic guarantees. For the games for which we already have good evaluation functions, the use of evaluation functions in MCTS algorithms achieved a success. However, the effect of evaluation functions on the performance of MCTS algorithms have not been investigated well, especially in terms of the quality of evaluation functions. In this study, we try to address this issue by using Othello (Reversi) as the target game. Based on the evaluation function used in Zebra, a top-level open-source player, we design 15 variants of evaluation functions and use them in three ways in MCTS algorithms. We conduct a set of experiments exhaustively and analyze the effect of evaluation functions in MCTS algorithms.

Keywords: Monte-Carlo tree search, evaluation functions, Othello (Reversi)

DOI: 10.3233/ICG-180060

Journal: ICGA Journal, vol. 40, no. 3, pp. 294-304, 2018