I want to clarify however. If your evaluation function is not deterministic, aspiration search techniques become very dicey. This is a problem anyway with hash table implementations and speculate cutoffs based on the the alpha beta window (and especially the aspiration window) but it's worth mentioning.
However, there is nothing wrong with using alpha beta search with an evauation function that is not deterministic. - Don On Fri, 2007-04-06 at 16:24 -0400, Don Dailey wrote: > On Fri, 2007-04-06 at 12:43 -0400, [EMAIL PROTECTED] wrote: > > Alpha/Beta cutoffs only make sense when calling the evaluation > > function twice on the exact same position can be guaranteed to > > provide > > the exact same value. This is obviously not the case for MC > > evaluation, hence the success of UCT. > > I don't know if any of this is true. You can apply alpha beta > cutoffs whether the evaluation function is deterministic or not. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
