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 somehow weak. In particular, Go is not solved (in any sense of solving, even the weakest) beyond 6x6. We here investigate the use of Meta-MonteCarlo-Tree-Search, for building a huge 7x7 opening book. In particular, we report the twenty wins (out of twenty games) that were obtained recently in 7x7 Go against pros; we also show that in one of the games, with no human error, the pro might have won.
منابع مشابه
Towards MCTS for Creative Domains
Monte Carlo Tree Search (MCTS) has recently demonstrated considerable success for computer Go and other difficult AI problems. We present a general MCTS model that extends its application from searching for optimal actions in games and combinatorial optimisation tasks to the search for optimal sequences and embedded subtrees. The primary application of this extended MCTS model will be for creat...
متن کاملParallel Monte-Carlo tree search for HPC systems and its application to computer go
Monte-Carlo Tree Search (MCTS) is a class of simulation-based search algorithms. It brought about great success in the past few years regarding the evaluation of deterministic two-player games such as the Asian board game Go. A breakthrough was achieved in 2006, when Rémi Coulom placed 1st at the ICGA Computer Go Olympiad in Turin with his MCTS based Go programm CrazyStone in the 9× 9 devision....
متن کاملComputational Intelligence Meets Game of Go @ IEEE WCCI 2012 [Society Briefs]
Since 2008, National University of Tainan (NUTN) in Taiwan and other academic organizations have hosted or organized several human vs. challenged the humans in the competition. In addition to observing how many advances have been made in artificial intelligence, the competition also observed physiological measurements for testing cognitive science on the game of Go. The topic is " the Most Stra...
متن کاملComputational Intelligence Meets
Digital Object Identifier 10.1109/MCI.2012.2215493 Since 2008, National University of Tainan (NUTN) in Taiwan and other academic organizations have hosted or organized several human vs. computer Go-related events [1, 2, 3, 4, 5] in Taiwan and in IEEE CIS flag conferences, including FUZZ-IEEE 2009, IEEE WCCI 2010, IEEE SSCI 2011, and FUZZ-IEEE 2011. ChunHsun Chou (9P), Ping-Chiang Chou (5P), Joa...
متن کاملMonte-Carlo Tree Search Solver
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (LOA). A new MCTS variant, called MCTS-Solver, has been designed to play narrow tactical lines better in sudden-death games such as LOA. The variant differs from the traditional MCTS in respect to backpropagation and se...
متن کامل