[computer-go] Example for Morphys law in Evaluation

[Chrilly]

I have in Suzie the following seemingly logical rules:
Rule 1: If a group is evaluated dead, look if there is an adjacent dead 
opponent group which is even weaker ("more dead"). If yes, the group is not 
dead, but just weak.
Rule 2: If a groups is evaluated weak, look for a weaker adjacent opponent 
group. If yes, the group is not weak but okay.

The Rules are done in 2 passes, because after pass one the influence of the 
"really dead" groups is flipped and this can change the result for rule 2.

Enclosed is a simple example were these 2 rules produce in a very simple 
positionl nonsense. According to rule 1 the dead black group is upgraded to 
weak, because the white group on q2 is more dead (black to move is assumed).
In pass 2 the weak black group finds again a weaker neighbour group, q2 and 
its therefore updated to okay.

In this simple example one can fix the problem relative easy. But the 
interaction of groups is in my experience the real problem.

Chrilly 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: WrongUpdate-Example.sgf
Type: application/octet-stream
Size: 171 bytes
Desc: not available
Url : http://computer-go.org/pipermail/computer-go/attachments/20060920/84892bc0/WrongUpdate-Example.obj