Re: [computer-go] Third KGS tournament: game-end protocol

[Chris Fant <chrisfant@xxxxxxxxx>]

> 1. When B, W both passes, ask final_status_list
> 2. If results are same, we are fine and game ends
> 3. If there is a dispute on the status of the group, say there is a
> B's group, B lists it as alive, W lists it as dead;  The server should
> check whether the group is unconditional live by Benson's algorithm.
> If the group is actually unconditionally alive, mark W as the loser.
> If both party makes mistakes, then mark both as loser. And game ends
> 4. Otherwise, the burden of proof that the group is dead falls on W;
> 4. Server sends W command say attack <any vertex of that string/group>
> 5. If W refuses to generate a move, mark W as loser;
> 6. If W generates a move, then resume the alternative play until both
> passes and we go back to step 1.

Too much logic in the server.

Since everyone else is taking a stab at this, here is mine:

1. When B, W both pass, request final_status_list
2. If the results are same, we are done
3. If not, start requesting gen_move_cleanup (if it is not
implemented, assume a pass move)
4. After two more passes, all blocks are assumed alive.
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/