In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It requires a well defined goal to prove. This can be seen as a disadvantage. In contrast to proof-number search, Monte-Carlo evaluation is a flexible stochastic evaluation for game-tree search. In order to improve the efficiency of proof-number search, we introduce a new algorithm, Monte-Carlo Proof-Number search. It enhances proof-number search by adding the flexible Monte-Carlo evaluation. We present the new algorithm and evaluate it on a sub-problem of Go, the Life-and-Death problem. The results show a clear improvement in time efficiency and memory usage: the test problems are solved two times faster and four times less nodes are expanded on average. Future work will assess possibilities to extend this method to other enhanced Proof-Number techniques. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Saito, J. T., Chaslot, G., Uiterwijk, J. W. H. M., & Van Den Herik, H. J. (2007). Monte-Carlo proof-number search for computer Go. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4630 LNCS, pp. 50–61). Springer Verlag. https://doi.org/10.1007/978-3-540-75538-8_5
Mendeley helps you to discover research relevant for your work.