From the CG2010 conference, "Score-Bounded Monte-Carlo Tree Search" (google on that string) was using win/draw/loss to solve go sekiproblems. (But it seems more about score-bounding, than dealing with draws.)
All the papers of CG2010 conference are available in the website http://www.icga.org/cg2010.html.
Aja
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
