> > 1 - finding the local fights causing secondary modes in the > distribution by statistical analysis accross terminal nodes > 2 - solving the local fight "separately" > 3 - twining the solution (the local game tree) in the global search (game > tree) in a way that looks like Conway's methods in Winning Ways. But > instead of using he exact methods of Conway, it would be a MC version of it. > > I think 1 and 3 are the hardest parts to do, but on the other hand, as it > is now, this issue is sort of a horizon effect that troubles MC players in > general. I think dealing with this will be a major next step in computer go > and I'm convinced it can be done, I just don't know how. >
I agree 1 and 3 are the hardest parts to do, and they are very important. The difficulty is that in the game of Go local fights can correlate with each other at some point. It is not easy even simply to identify the correlation. Aja
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
