An imperfect evaluation has errors. Is the exact value of the error known? No. Thus, it's random. :) Daniel Liu -----Original Message----- From: [EMAIL PROTECTED] To: computer-go@computer-go.org Sent: Fri, 6 Apr 2007 10:57 AM Subject: Re: [computer-go] The dominance of search (Suzie v. GnuGo)
On 4/6/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote: > When it comes to a search, one need to ask that is my evaluation function > perfect? There are exceptional cases in the late endgame and on tiny boards, but in general this is not an interesting question (because it obviously won't be perfect). In my opinion the question should be: is the evaluation function of a probabilistic nature. 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. Erik _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/ ________________________________________________________________________ AOL now offers free email to everyone. Find out more about what's free from AOL at AOL.com.
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
