Hi Robert, I too have problems with receiving mails form this list. Hence, sorry for late replies. Thanks to veg for working on this issue!
1) Use of the term semeai In this paper the term "semeai" is indeed not used in the most accurate fashion. We realized this only after the paper was already accepted (thanks to a comment by Rémi Coulom) and addressed this issue in the conclusion section: "For the sake of correctness, we must admit that the term semeai might not be completely appropriately used throughout this paper. A score cluster does not always need to be caused by the presence of a capturing race. In any case, it represents an evaluation singularity that is likely caused by uncertainty in the evaluation of the life and death state of one or more groups of pieces. Also in this case our approach will help to localize the respective groups on the board." 2) Identification of score clusters The score clusters are obtained by analyzing the observed outcomes of the semi-randomized MC simulations. The identification of the critical board regions has no two-value-logic evidence. 3) two-safe-group It is a term used by Aja Huang to describe a class of Go positions he created, that contain two safe but not yet completely settled groups. The positions were created with the aim to be difficult to understand for current MC programs. Aja Huang and Martin Müller recently published a very nice paper about this test suite and experimental results with a number of strong Go programs. You can find their paper "Investigating the Limits of Monte Carlo Tree Search Methods in Computer Go" here: http://webdocs.cs.ualberta.ca/~mmueller/publications.html 4) runtime We plan to use this heuristic foremost in near root nodes. It is certainly to expensive to be used all over the tree. The collection of the necessary data is pretty efficient. The mode seeking part is a bit more involved, but not more expensive than the computation of other state-of-the-art heuristics used for move prediction. This is at least the case for Gomorras implementation of those heuristics. Once again: The described heuristic is yet not used in our "productive" version of Gomorra. Its application to improve the MCTS search process is still research in progress. Cheers, Lars On 09.10.2013 15:30, Lars Schäfers wrote: > "On Semeai Detection in Monte-Carlo Go" In this paper, does "semeai" stand for "one of 'capturing race', 'unsettled life and death situation', 'basic ko fight', 'multiple ko fight', 'ladder breaking' 'etc.'"? Is the identification of a cluster proven only with stochastic probability, or is there even two-value-logic evidence? What is a two-safe-group? How do the methods affect simulations runtime? -- robert jasiek -- Lars Schaefers Computer Engineering Group of Prof. Dr. Marco Platzner Paderborn Center for Parallel Computing, University of Paderborn Pohlweg 47-49, 33098 Paderborn, Germany Tel: +49 (0)5251 60 4341, Fax: +49 (0)5251 60 5377 Office: Building O 3.119 _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
