Re: [computer-go] Mathematically sound rules for determiningwhen the game is over

[Dave Dyer <ddyer@xxxxxxxxxxx>]

One situation where programs are likely to make an error
is where where filling liberties requires other, non-local 
connections to be made, or other non-local liberties to be
filled.   If the program doesn't fill all the dame in the
correct order, it's likely that the "wrong" group will be
captured, or that some group will be captured which should
be safe, or conversely that a dead group will be brought back
to life.

I'm not aware of any general theory that determines what
the right order is.  My scoring algorithm runs the problem
solver to try to capture each group, and iterates until all
groups are safe no matter which player moves first.  Of course,
this depends on the problem solver getting it right, and under
unusual circumstances, the problem solver "blows up" if the
search expands to involve too many groups, or gets the wrong
answer if it fails to expand the search when it should have.

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