Combining Tactical Search and Monte-Carlo in the Game of Go

We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting goals, and computes statistics on the realization of tactical goals during the random games. The mean score of the random games where a selected tactical goal has been reached and the mean score of the random games where it has failed are computed. They are used to evaluate the selected goals. Experimental results attest that combining search and Monte-Carlo significantly improves the playing level.

• Type: Conference
• Year: 2005
• Where: CIG
• Authors: Tristan Cazenave, Bernard Helmstetter
• Keywords: CIG 2005, Mean Score, Random Games, Tactical Goal