Page 1 of 1

Example of superko complexity

Posted: Mon Nov 13, 2023 12:08 pm
by Gérard TAILLE
Click Here To Show Diagram Code
[go]$$B
$$ --------------------
$$ |. X X . O X X X . |
$$ |X O O O O X X X X |
$$ |. O O X X X X X X |
$$ |O O O X . . . . . |
$$ |X X X X X X X X X |
$$ |O O O O O O O O O |
$$ |O O O O O O O O O |
$$ |O X X X X X O O O |
$$ |. O X . X . X O . |
$$ --------------------[/go]
In the position above you can see a double ko on the bottom of the board and the possibility of a sending 2 - retun 1 in the upper left corner.
My question is the following. Assuming AGA rules (superko based on SSK) and assuming a pass does not lift the ko ban, what is the result if black to play and if white to play?
If you solve this problem easily then the rule used is fine but did you find easily the final result?

Re: Example of superko complexity

Posted: Mon Nov 20, 2023 2:54 am
by Yoav Yaffe
=== SPOILER ALERT ===

The link https://senseis.xmp.net/?StrategicDiffe ... koVariants (found in https://www.lifein19x19.com/viewtopic.php?f=45&t=15744 ) will lead you to the (quite surprising) answer. You'll also find there (a claim about) the result under PSK.