Hi, GoTools by Thomas Wolf is top.
Ingo. > Gesendet: Sonntag, 23. Juni 2013 um 04:11 Uhr > Von: "Mark Goldfain" <[email protected]> > An: [email protected] > Betreff: [Computer-go] Tsumego Solvers > > Does anyone have a good tsumego-solving program? It seems a good, > separate question, not necessarily part of a full game-playing program. > I'd like to see if I could modify one to seek specific goals. For > example, given a portion of a board, is there a move sequence that > successfully invades and lives? Then, given that one can invade and > live, with some initial move giving probability of success alpha, then > lowering the threshold slightly to beta, which move gives the > largest-point outcome with probability > beta ? > > Example: > > ++@++@@@++ black = @ > ++@+++++++ white = O > +++@++++++ > ++@+++++++ white to move > ++@+++O+++ > +++@@++O++ > ++++++@@O+ > ++++++++++ > > If this diagram renders well, then the first question is what move for > white has the best probability of living? But the second question, is > whether one sequence of moves leads to more damage to black's moyo than > other sequences. > > I'd be interested to hear from someone who has either worked on such > issues, or has a tool that they feel is helpful for such questions. I'd > also like to hear which programs include this kind of reasoning in their > repertoire. > > Many thanks, > -- Mark > > _______________________________________________ > Computer-go mailing list > [email protected] > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go > _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
