Example of superko complexity

For discussing go rule sets and rule theory
Post Reply
Gérard TAILLE
Gosei
Posts: 1346
Joined: Sun Aug 23, 2020 2:47 am
Rank: 1d
GD Posts: 0
Has thanked: 21 times
Been thanked: 57 times

Example of superko complexity

Post 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?
Yoav Yaffe
Beginner
Posts: 6
Joined: Mon Jun 14, 2021 6:07 am
GD Posts: 0
Been thanked: 3 times

Re: Example of superko complexity

Post 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.
Post Reply