Towards a solution of 7x7 Go with Meta-MCTS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Towards a solution of 7x7 Go with Meta-MCTS


Solving board games is a hard task, in particular for games in which classical tools like alpha-beta and proof-number-search are some- how weak. In particular, Go is not solved (in any sense of solving, even the weakest) beyond 6x6. We here investigate the use of Meta-Monte- Carlo-Tree-Search, for building a huge 7x7 opening book. In particular, we report the twenty wins (out of twenty games) that were obtained re- cently in 7x7 Go against pros; we also show that in one of the games, with no human error, the pro might have won.
No file

Dates and versions

hal-01077624 , version 1 (26-10-2014)


  • HAL Id : hal-01077624 , version 1


Cheng-Wei Chou, Li-Wen Wu, Hui-Min Wang, Fabien Teytaud, Olivier Teytaud, et al.. Towards a solution of 7x7 Go with Meta-MCTS. Advances in Computer Games, 2011, Tilburg, Netherlands. pp.12. ⟨hal-01077624⟩
238 View
0 Download


Gmail Facebook X LinkedIn More