Re: computer-go: Engineering (was: Most simple Go rules)

[John Tromp <tromp@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx>]

> >This is close to Mark Boon's idea which is also  interesting, if I got
> >it right it goes like this:
> >
> >   If either player passes, the arbiter calculates a score and informs
> >   both parties.   If both parties agree, the game is over.

For the agreement, it's not the arbiter's job to compute scores, since
this would involve deciding what stones are dead.
The agreement extension to tromp/taylor says:

6.As a practical shortcut, the following amendment allows "dead stone removal": 
    After only 2 consecutive passes, the players may end the game by agreeing on which points to empty.
    After 4 consecutive passes, the game ends as is. 

So the simplest protocol is that after 2 passes, both programs inform the
arbiter of their idea of the score, and if equal, that's the result
(whether correct under perfect play is irrelevant). If not, then play
resumes. There's no need to inform each program of the other's claim.
The side for whom scoring-as-is is advantageous can just pass,
while the other side will presumably proceed to capture some dead stones,
to avoid the 4 pass clause.
This may continue for any number of times, until either
-agreement is reached after 2 passes
-4 consecutive passes occur
-or time runs out.

> If both parties agree that Black has won, but they disagree about the
> winning margin, and "really" White has won, then who has won?

It is presumptious to assume that we can even always know who "really" won. 

regards,

%!PS                       %  -John Tromp (http://www.cwi.nl/~tromp/)
42 42 scale 7 9 translate .07 setlinewidth .5 setgray/c{arc clip fill
setgray}def 1 0 0 42 1 0 c 0 1 1{0 3 3 90 270 arc 0 0 6 0 -3 3 90 270
arcn 270 90 c -2 2 4{-6 moveto 0 12 rlineto}for -5 2 5{-3 exch moveto
9 0 rlineto}for stroke 0 0 3 1 1 0 c 180 rotate initclip}for showpage