On Wed, Apr 6, 2011 at 6:05 PM, Brian Sheppard <[email protected]> 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. Erik _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
