On Dec 13, 2007 3:33 PM, Chris Fant <[EMAIL PROTECTED]> wrote: > Seems like the final solution to this would need to build out the > search tree to the end of the game, finding a winning line. And then > search again with a different evaluation function (one based on > points). If the second search cannot find a line that wins bigger > than the first search did, just play the move returned by the first > search. And you could get more clever be allowing the second search > to start with some information from the first search. Note that when > I say "winning line", I mean all the way to the end. No MC here. >
Actually, I suppose it need not be to the absolute end of the game. As long as all MC sims that finish out the game prior to scoring lead to a win, then you can consider the tree portion a guaranteed winning line and try the second search to maximize points. _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
