How does the Benson algorithm result in shorter playouts? A more precise question: how does your playout apply the ability to determine unconditional life to the question of which moves one should play in the playout, or to determining whether to continue to play out.
Thanks -----Original Message----- From: [email protected] [mailto:[email protected]] On Behalf Of Erik van der Werf Sent: Wednesday, April 06, 2011 10:49 AM To: [email protected] Subject: Re: [Computer-go] living by two false eyes On Wed, Apr 6, 2011 at 4:11 PM, fastgo <[email protected]> wrote: > In StoneGrid, it has built in the Benson algorithm in the playout. It does > not seem to help much on overall strength. But I think it should solve the > case here. > > I think you can implement the Benson Algorithm in the late stage of the > playout. > > It has another advantage finishing the playout in shorter length. In > StoneGrid, the playout on average finishes in a little bit more than 70 > stones on 9x9. > > You need quite a lot of effort to get it fast as well as correct. So the > return of the effort is low. I also have it in my program. The funny thing is that if I disable it the program actually becomes slower because of the longer playouts... Erik _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
