Re: Re: [computer-go] Mathematically sound rules for determining whenthe

[<mpe501@xxxxxxxxx>]

> 
> >Hello,
> >I've been trying to figure out a good set of rules for unequivocally 
> >determining when a game is over. Ssince mutual passing only works 
> >when both players agree on the score, what happens if they never 
> >agree, regardless of how far the game progresses? If the rules of go 
> >are to be logically sound there must be a way to determine the score 
> >from the rules of the game when it has been fully played out.
> >
> >What I've come up with is: (I'm assuming chinese rules with super-ko rule.)
> >* The game is over when neither black nor white have any valid moves 
> >except moves that put one of its own groups into atari.
> >* When the game is over your score is the number of stones of your 
> >colour on the board and the number of empty intersections surrounded 
> >on all sides by stones of your colour.
> >
> >This seems to work; when all groups have only two one-stone eyes or 
> >are in seki the game is over and the score is easy to determine. But 
> >are there any problems or inconsistensies with the standard rules 
> >that I'm missing?
> >
> >Regards,
> >David
> >
> >_______________________________________________
> >computer-go mailing list
> >computer-go@xxxxxxxxxxxxxxxxx
> >http://computer-go.org/mailman/listinfo/computer-go
> 
> 
> Maybe I'm being silly, but. Suppose white has filled all the board except
> a three-in-a-row, and black has one stone in the middle of it. Neither can
> play except to put an own group into atari but the game is not over!
> 
> Arthur

true =(


_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://computer-go.org/mailman/listinfo/computer-go