Gérard TAILLE wrote:
- Click Here To Show Diagram Code
[go]$$B
$$ -----------------
$$ | O X . X . O . |
$$ | . O X X X O O |
$$ | O . O O X X O |
$$ | O O O . O X O |
$$ | X X O O X X O |
$$ | . X X O O O . |
$$ | X . X X X O O |
$$ -----------------[/go]
BTW, though the global ko-pass defined in J2003 is also a big progress, it is a pity to see that the status of white stones is still dead stones (=> seki => white should add a move)
I think it was Robert's intention to develop a logically closed and contradiction-free set of rules, which was able to achieve the desired results of the J89 life-and-death examples.
As far as I understand J2003, this particular ko-pass-rule is both appropriate and necessary to fulfill the above-mentioned task.
By the way:
- Click Here To Show Diagram Code
[go]$$B
$$ -----------------
$$ | P X . X . O . |
$$ | 1 O X X X O O |
$$ | O 2 O O X X O |
$$ | O O O . O X O |
$$ | X X O O X X O |
$$ | . X X O O O . |
$$ | X . X X X O O |
$$ -----------------[/go]
It does not matter that White would have to add a move to get rid of the seki in J89 status corfirmation.
During actual play, Black is able to capture

with

, forcing White to connect at

, also gaining that specific point, due to the just won prisoner.
However, this raises the question, why Black should benefit in the status confirmation from having made a mistake during actual play?
+ + + + + + + + + +
By the way #2:
An insight that I have gained from working with various sets of (territorial) rules:
BEFORE designing such a rule set, you will have to decide about at least two decisive questions:
Do you want to behave a final position differently, depending on whether a specific DOUBLE-Ko is already part of the final position
- Click Here To Show Diagram Code
[go]$$B
$$ -----------------
$$ | . X . X . O . |
$$ | X O X X X O O |
$$ | O O O O X X O |
$$ | O O O . O X O |
$$ | X X O O X X O |
$$ | . X X O O O . |
$$ | X . X X X O O |
$$ -----------------[/go]
or not, but arises during the course of the status confirmation?
- Click Here To Show Diagram Code
[go]$$B
$$ -----------------
$$ | O X . X . O . |
$$ | 1 O X X X O O |
$$ | O 2 O O X X O |
$$ | O O O . O X O |
$$ | X X O O X X O |
$$ | . X X O O O . |
$$ | X . X X X O O |
$$ -----------------[/go]
Do you want to behave a final position differently, whether it contains a solidly connected TRIPLE-Ko that is shared by only two groups
- Click Here To Show Diagram Code
[go]$$B
$$ -----------------
$$ | . X X X O O O |
$$ | O O X X O . . |
$$ | O X 2 X O . . |
$$ | O O X X O . . |
$$ | O 3 O X O . . |
$$ | O O X X O O O |
$$ | O 1 O X O . . |
$$ -----------------[/go]
or not, but has the three ko-shapes farther away from each other?
- Click Here To Show Diagram Code
[go]$$B
$$ +---------------------------------------+
$$ | 1 O O . O . O X 2 X O . O X . . . . . |
$$ | O X X O O O O X X O O O O X . . . . . |
$$ | X X . X X X O X O 3 O X X X . . . . . |
$$ | . . . , X O X X X O O X . . . , . . . |
$$ | . . . . X O X . X O X X . . . . . . . |
$$ | . . . . X O X X O X X . . . . . . . . |
$$ | . . . . X O O O O . . . . . . . . . . |
$$ | . . . . . . . . . . . . . . . . . . . |[/go]
J89 answers both quesions with "Yes!", but I doubt that this is mandatory.
_________________
The really most difficult Go problem ever:
https://igohatsuyoron120.de/index.htmIgo Hatsuyōron #120 (really solved by KataGo)