Bandit-Based Genetic Programming

We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical properties, outperformed a highly optimized handcrafted module of a well-known computer-Go program with several world records in the game of Go.

• Type: Conference
• Year: 2010
• Where: EUROGP
• Authors: Jean-Baptiste Hoock, Olivier Teytaud
• Keywords: EUROGP 2010, Monte-Carlo Tree Search, Proved Mathematical Properties, Well-known Computer-Go Program