Playing the Right Atari

We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is contained in one page of code and the Go program that uses it improves from 50 % of won games against Gnugo 3.6 to 76 % of won games.

• Type: Journal
• Year: 2007
• Where: ICGA
• Authors: Tristan Cazenave
• Keywords: Go Program, ICGA 1997, ICGA 2007, Monte-Carlo Go Tree, Powerful Optimization