RE: computer-go: Engineering (was: Most simple Go rules)

["Grajdeanu, Adrian" <adrian.grajdeanu@xxxxxxx>]

> Since computer programs have no incentive to agree to 
> anything unfavourable to them (i.e. their stones being
> dead), some will never agree. Then how are you going
> prove something that doesn't have a logical definition?

If the stones are dead, they are capturable (few exceptions here when they
are dead by definition). So in this case if the program doesn't agree, then
the opponent captures the dead stones and then there won't be anything left
to argue about.

How's this for logical definition:
A stone is alive if it is part of a string that is part of a group that has
two eyes or is in seki.
A string is a set of connected intersection of the same color.
A group is a set of groups that the opponent cannot separate.