[Computer-go] living by two false eyes
sheppardco at aol.com
Wed Apr 6 09:05:20 PDT 2011
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.
From: computer-go-bounces at dvandva.org
[mailto:computer-go-bounces at dvandva.org] On Behalf Of Erik van der Werf
Sent: Wednesday, April 06, 2011 10:49 AM
To: computer-go at dvandva.org
Subject: Re: [Computer-go] living by two false eyes
On Wed, Apr 6, 2011 at 4:11 PM, fastgo <fastgo at gmail.com> 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
> 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...
Computer-go mailing list
Computer-go at dvandva.org
More information about the Computer-go