Re: computer-go: Computer Go Tournament Program

[Robert Jasiek <jasiek@xxxxxxxx>]

Robert Jasiek wrote:
> Before implementing some agreement phases their maximal
> number during one game and the exact meaning of passes
> should be specified. The maximal number could be one or
> infinity, depending on the wording.

To shorten the discussion, here is an algorithm for
Tromp-Taylor in case the number of agreement phases is 
exactly one:

WHILE (TRUE)
{
alternation of moves;
IF (player A and then player B have passed successively)
{
 IF (both players agree on all removals)
 {
 do all removals;
 end game;
 score;
 EXIT;
 }
 ELSE
 {
  WHILE (TRUE)
  {
   continue alternation of moves with player A;
   IF (player C and then player D have passed successively
   during continued alternation)
   {
    end game;
    score;
    EXIT;
   }
  }
 }
}
}

***

"all removals" can be replaced by "Score", if preferred.
Then no removals are done and score=Score.

--
robert jasiek