I think Martin Mueller published an improvement to benson's algorithm that is also proved correct.
David From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of John Fan Sent: Thursday, December 13, 2007 1:36 PM To: computer-go Subject: Re: [computer-go] MC-UCT and tactical information Yes, StoneGrid only uses Benson's algorithm. On Dec 13, 2007 4:30 PM, <[EMAIL PROTECTED]> wrote: That's a strong program, and interesting information. For clarity, I assume that you mean something like Benson's algorithm, while my intended meaning was "alive assuming perfect play." Both are relevant, we just need to keep them sorted out. - Dave Hillis -----Original Message----- From: John Fan <[EMAIL PROTECTED]> To: computer-go <computer-go@computer-go.org> Sent: Thu, 13 Dec 2007 3:42 pm Subject: Re: [computer-go] MC-UCT and tactical information My program StoneGrid calculates unconditional life and death at every move, in the UCT Tree and in the random playout. I think it helps on its strength a little bit, especially in the end game. In the begining of the game, seems to be completely useless. It is slow. But it makes the random playout slightly shorter. The random playout is about 80 moves per game. I do not have a comparison if the unconditional life and death is disabled, since it is not easy to do in the current data structure. _____ More new features than ever. Check out the new AIM(R) Mail <http://o.aolcdn.com/cdn.webmail.aol.com/mailtour/aol/en-us/text.htm?ncid=ai mcmp00050000000001> ! _______________________________________________ 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/
