On Sun, Jun 7, 2009 at 6:05 PM, Brian Sheppard <sheppar...@aol.com> wrote:
> > check if overtaking the leading move is mathematically impossible? > > Yes. Pebbles does this. > > Please note that the discussion has veered into time control policy, > which is not the subject of the original post. The original post discusses move selection policy: when your program > stops, for whatever reason, which move should it select? Pebbles' policy > is to select the move that has the most wins, rather than the most trials. > > Pebbles policy is a risk-free improvement over the standard policy > of selecting the move that has the most trials. Even though it may please you to to treat time control and move selection as if they are totally unrelated, that's just not the case in real programs. So I don't really see that this discussion has veered in any way. - Don > > > Brian > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ >
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
