Score Bounded Monte-Carlo Tree Search

Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It is for example the case in games that can end in draw positions. In this case it improves significantly a MCTS solver to take into account bounds on the possible scores of a node in order to select the nodes to explore. We apply our algorithm to solving Seki in the game of Go and to Connect Four.

• Type: Journal
• Year: 2010
• Where: CG
• Authors: Tristan Cazenave, Abdallah Saffidine
• Keywords: Art Game Engines, CG 2010, Computer Graphics, Game, Monte-Carlo Tree Search