Towards a solution of 7x7 Go with Meta-MCTS
Résumé
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.