Thomas Wolf wrote a life-and-death program some while back, with much stronger
abilities; he mentions that it only works for fully enclosed positions.
http://www.qmw.ac.uk/~ugah006/gotools/
You may wish to read http://lie.math.brocku.ca/twolf/papers/mono.pdf
Dave Dyer is too modest to refer to his own work at
http://www.andromeda.com/people/ddyer/go/shape-library.html
Terry McIntyre <[EMAIL PROTECTED]>
They mean to govern well; but they mean to govern. They promise to be kind
masters; but they mean to be masters. -- Daniel Webster
----- Original Message ----
From: Dave Dyer <[EMAIL PROTECTED]>
To: computer-go <computer-go@computer-go.org>; computer-go
<computer-go@computer-go.org>
Sent: Thursday, December 13, 2007 2:03:33 PM
Subject: [computer-go] Re: unconditional life and death
The standard one is Benson's algorithm
http://senseis.xmp.net/?BensonsAlgorithm
The standard caveat is that this algorithm alone is very weak - it
typically applies to zero stones on a position played out using
Japanese rules. But you have to start somewhere.
____________________________________________________________________________________
Never miss a thing. Make Yahoo your home page.
http://www.yahoo.com/r/hs_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
