Re: [computer-go] False Eyes

[Tomas <tomas@xxxxxxxxxxxxx>]

Christoph Vielhauer wrote:

> Hi all,
>  
> here is a proposal for a set of rules to tell "false eyes" from "real 
> eyes". 

I believe the following the following algorithm is much simpler, also 
then Bensons:

Considering stones of one color only:
- An incapturable eye is an empty spaces surrounded on four sides by 
either border or incapturable strings
- An incapturable string is a string of stones that is directly 
connected to two dsitinct incapturable eyes.

The reason this works is because it simply states that something is 
incapturable if two eyes need to be filled in one move.

Obviously Bensons algorithm and others cover MORE situations then this 
algorithm , but in programming a computer Go program this is useless 
since the program will have to understand anyway that something is alive 
if all trees LEAD to life. I do not understand why someone would choose 
a slow algorithm such as Bensons, only to cover more (but still not all) 
situations.

I therefore recommend using a fast and simple implementation of the 
above definition.

gr Tomas


_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/