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

[Don Dailey]

Does mogo have a play-out rule that says, don't move into self-atari?  
If so, then I can see how the play-out would miss this.

But the tree search would not miss this.    I still don't see the
problem.   I can see how a play-out strategy would delay the
understanding of positions,   but that's not relevant - all play-out
strategies introduce some bias.    Uniformly random play-outs delay the
understanding of positions too for instance.

- Don


Gian-Carlo Pascutto wrote:
> 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.
>