[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: computer-go: Most simple Go rules



At 07:33 AM 6/24/01, Robert Jasiek wrote:


>Dave Dyer wrote:
>> If there are N ko's
>> on the board, there are 2^N positions that can be cycled through
>> before any move irrelevant to the ko must be played.
>
>You speak of "ko" in general as if any definition would exist.
>Which, please? Do you mean "shapes with 2-play loops" instead
>of "ko"?

Yes. that's what I mean.