Re: computer-go: Go4++: Passing in tsume searches.

["Michael Reiss" <mick@xxxxxxxxxxxxxxxxx>]

> Jean-Pierre Vesinet wrote:
>
> > There _may_ be some sort of unstable seki. A move played by the attacker
> > would force the defender to answer. This move would then force a move by
the
> > attacker to keep the position a seki. Then the defender passes again. If
the
> > defender's position still has some weakness, the attacker can force a
> > defensive move again. This is difficult to construct. Maybe the rules
> > experts could help on the go rules mailing list?
>
> The following position seems to meet this description.
>
> O O O O O O X X X X X
> O X X X X X O O O O X
> O X . X . O . O . O X
> ---------------------
>
> O can play atari on the first line after which X captures
> and O takes back. Infinite ko threats for O. However the
> position is seki.

Under my system this does not count as a tsumego problem because
it is not neatly bound by one colour.

Also please note that ko's are handled very differently in
my tsumego solver. In many peoples tsumego solvers I guess
that an external ko threat is often represented by a pass
move, but in my system there are no external ko threats
required because one side is winning all ko's. Take another
look at my original post to see what I mean.

Mick.