[Computer-go] living by two false eyes

Erik van der Werf erikvanderwerf at gmail.com
Wed Apr 6 10:41:04 PDT 2011

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.


More information about the Computer-go mailing list