RE: [computer-go] False Eyes

["David Fotland" <fotland@xxxxxxxxxxxxxxx>]

> -----Original Message-----
> From: computer-go-bounces@xxxxxxxxxxxxxxxxx 
> [mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx] On Behalf Of Tomas
> 
> 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.

The reason we want to recognize yes that are larger than a single point is
because we want a program that
can play agame of go without spending years on each move.  Many Faces spends
a lot of time recognizing large eyes to avoid the huge amount of reading
required to prove life and death using your algorithm.

David


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