Testing autoscore algorithms

My goal is to automatically determine which stones are dead from a couple of AI estimates that give you dead/live/unsettled. The idea that I took from Vsotvep (though it was different from what he had intended) was to resolve the unsettled ones with an estimate of the ownership of “unsettled area”:

(I think he meant to also include the dead stones in that definition.) I guess I prefer to say “region” since “area” already has a particular meaning in Go.

The boundary can only have live stones, since the region expands to include all others. Look at the eggplant region from one of the links above for an example:

image image

I said “not counting stones touching only unsettled stones”. I don’t know about “most”, but in the one above the unsettled group dies, since the whole eggplant boundary consists of black stones, specifically the the seven highlighted here:

image

(The white stone above is initially part of the boundary, but it gets promoted to unsettled as described. And yes, it’s just direct touching.)

But consider this situation (which actually had a bug that I fixed just now :flushed:):


image

Since we don’t count ones that only touch unsettled stones, there are NO live boundary stones at all. With no black or white stones to count, the region is considered dame and all unsettled stones live.

I call a region dame if it has both colors in its boundary or an empty boundary (like the rectangular six above).

After your earlier comments I decided that the tie-breaker idea was too arbitrary. So all that v3 cares about is whether the “count” is positive. We only assign a winner to the region if the count is positive for one color and zero for the other. Otherwise, everything lives.

I hope that clears it up a bit.

Now, is it like a different ruleset? Since I’m proposing to just use this for life/death and then follow the normal rules of go for doing the actual score counting, I think it gets us closer to the traditional rules than what we have now. And I hope that there aren’t any properly finished games that the algorithm will mark incorrectly. I do think that there are things about Internet Go that are just necessarily going to make it different than real life games, and I’d like to work on making it different in the right way.

2 Likes