Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Polar IFS+Parisian Genetic Programming=Efficient IFS Inverse Problem Solving
Genetic Programming and Evolvable Machines
Combining online and offline knowledge in UCT
Proceedings of the 24th international conference on Machine learning
Lower Bounds for Evolution Strategies Using VC-Dimension
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Efficient selectivity and backup operators in Monte-Carlo tree search
CG'06 Proceedings of the 5th international conference on Computers and games
CG'06 Proceedings of the 5th international conference on Computers and games
Bandit based monte-carlo planning
ECML'06 Proceedings of the 17th European conference on Machine Learning
Innovative opening-book handling
ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
Intelligent agents for the game of go
IEEE Computational Intelligence Magazine
Scalability and parallelization of Monte-Carlo tree search
CG'10 Proceedings of the 7th international conference on Computers and games
Principled method for exploiting opening books
CG'10 Proceedings of the 7th international conference on Computers and games
A human-computer team experiment for 9×9 go
CG'10 Proceedings of the 7th international conference on Computers and games
Creating an upper-confidence-tree program for havannah
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
Bandit-Based genetic programming
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
Hi-index | 0.00 |
This paper presents a successful application of parallel (grid) coevolution applied to the building of an opening book (OB) in 9x9 Go. Known sayings around the game of Go are refound by the algorithm, and the resulting program was also able to credibly comment openings in professional games of 9x9 Go. Interestingly, beyond the application to the game of Go, our algorithm can be seen as a "meta"-level for the UCT-algorithm: "UCT applied to UCT" (instead of "UCT applied to a random player" as usual), in order to build an OB. It is generic and could be applied as well for analyzing a given situation of a Markov Decision Process.