[computer-go] State of the art of pattern matching

[Christoph Birk]

On Mar 31, 2008, at 1:05 PM, Don Dailey wrote:
>
>
> Christoph Birk wrote:
>>
>> On Mar 31, 2008, at 10:48 AM, Mark Boon wrote:
>>> I don't know about this. I'm pretty sure MoGo checks if the stone  
>>> can
>>> make at least two liberties (ladder problem) in which case it can
>>> still be horrible but very seldomly worse than random.
>>
>> I would expect playing a "not-working" ladder to be worse than random
>> most
>> of the time.
> Of course this is true, but presumably a move that answers a direct
> atari threat would classify as being better than random.

Not if it's a working ladder.

Christoph