[Computer-go] living by two false eyes

Brian Sheppard sheppardco at aol.com
Wed Apr 6 10:59:40 PDT 2011

Pebbles used to implement a related concept that terminated playouts when
there was an obvious winner. This was done on the basis of stone count. But
I followed up on a suggestion from Mark Boon, and deleted the code. Pebbles
was just as fast, and simpler, and there was less chance of stumbling onto
bad cases.

But I have not tried to detect unconditional life in the playout, so I will
add that to my long list of ideas to test.


-----Original Message-----
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 1:41 PM
To: computer-go at dvandva.org
Subject: Re: [Computer-go] living by two false eyes

On Wed, Apr 6, 2011 at 6:05 PM, Brian Sheppard <sheppardco at aol.com> wrote:
> How does the Benson algorithm result in shorter playouts?

The playout can terminate early when you have a proof that more than
half of the points belong to one side (my program not only determines
life but also territory). Also, as others already pointed out,
avoiding bad moves tends to shorten the playouts.

Computer-go mailing list
Computer-go at dvandva.org

More information about the Computer-go mailing list