[computer-go] Example for Morphys law in Evaluation

[Chrilly]

>>>
>>> With static full board evaluation one needs a complete and correct
>>> implementation of all possible situations that are likely to arise on a 
>>> go
>>> board. If there is limits in the evaluation then I think search will not 
>>> be
>>> able to compensate for this.
>>>
>
>>> With MC evaluation one can add some simple local knowledge which 
>>> improves the
>>> evaluation in most situations, and search work quite well in removing 
>>> those
>>> moves that evaluated too high early in search.
>>
Alpha-Beta has exactly the same purpose. The search is an 
error-filter/corrector. The problem is that the current Alpha-Beta search is 
in Go to shallow - or the problems are too deep.
The position I presented initially was not the board position, but the end 
of a 5 ply search.  The black area was greater, but white could cut and 
reduce it. Suzie did not prevent this, because she thought there is no 
problem even after the cut.
One has in principle the same problems with a 20 Plies search. But in this 
case I would not have seen the consequences. Neither would be the opponent 
GoAhead be able to exploit the problem.
In this position Suzie would have seen the problem with a 6 plies search, 
were white can connect q2 to the strong white group.

Chrilly