Loading timeline…
20062000s
Rémi Coulom
Named Monte Carlo tree search and proved it on the Go board with Crazy Stone, a decade before AlphaGo.
Organizations
Lille 3 UniversityINRIA
Major Achievements
- •Introduced and named Monte Carlo tree search in 2006, combining random playouts with selective tree growth.
- •Built Crazy Stone, the program that demonstrated the method and won the 2006 Computer Olympiad Go tournament.
- •Broke the deadlock in computer Go, where the branching factor had defeated conventional search.
- •Developed the Whole-History Rating system for estimating player strength.
Key Papers
- Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Rémi Coulom · Computers and Games 2006