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

["Michael Reiss" <mick@xxxxxxxxxxxxxxxxx>]

> correction...
> 
> >Now, can anyone find a situation where *two* defender passes 
> >are required?
> 
> considering suicides not allowed
> 
>    6 . . . . . . . .
>    5 * * * * * . . .
>    4 o o o o * . . . 
>    3 * * . o * * * .
>    2 . o * o o o * .
>    1 * * * o . o * .
>      A B C D E F G H
> 
> white must pass. if black plays the non optimal move A2. white 
> must pass again. after C3 white must answer with B2. i think 
> situations like this can be created for arbitrarily many passes 
> as non optimal moves often must be considered in searches.

Congratulations for constructing the position... but now I am
really annoyed, I was hoping that I could help reduce the size of
my trees by limiting the number of defensive passes that need to
be considered :-(

...by the way can you construct a situation requiring 
three passes??

Mick.