> Are there any publications (scientific papers or mailing list posts or > whatever) on adapting MCTS to jigo results? So far, I have only heard > that it is surprisingly annoying problem to tackle, though I have to > admit I did not think about it much myself.
>From the CG2010 conference, "Score-Bounded Monte-Carlo Tree Search" (google on that string) was using win/draw/loss to solve go seki problems. (But it seems more about score-bounding, than dealing with draws.) Even komi might also be interesting in tournaments - programs might choose to load their safer "play-for-a-draw" opening book when leading the tournament or playing someone stronger than them. Darren -- Darren Cook, Software Researcher/Developer http://dcook.org/gobet/ (Shodan Go Bet - who will win?) http://dcook.org/work/ (About me and my work) http://dcook.org/blogs.html (My blogs and articles) _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
