[computer-go] 19x19 Study - prior in bayeselo, and KGS study

[Gian-Carlo Pascutto]

Don Dailey wrote:

> Yes,  the tree generates pass moves and with 2 passes the game is scored
> without play-outs.  

How do you detect dead groups after 2 passes? Static analysis? All is 
alive/CGOS?

>>> I can't believe mogo doesn't do this, it would be very weak
>>> if it didn't.
>> That's just an assumption shaped by a non-objective human bias.
> 
> So are you saying that if mogo had this position:
> 
> | # # # # # #
> | O O O O O #
> | + + + + O # 
>   a b c d e
> 
> That mogo would not know to move to nakade point c1 with either color?

I was referring to your "it would be very weak", not to what MoGo does 
or does not do. I don't know exactly what MoGo does. I do know you can 
not know the above and not be "very weak". You can also not know about 
ladders and not be "very weak". Many people seem to think this is 
completely unfathomable, and I was surprised you made the same mistake.
I think it has something to do with both things being the first things a 
human player learns. Because he thinks it's basic, he concludes anybody 
not knowing it is weak. But strength just doesn't work that way.

-- 
GCP