Weak score estimator and Japanese rules

[benjito]

@gennan

What about using shortest Manhattan distance to decide which color an intersection belongs to (with stones being opaque to influence propagation)?

That’s what I’m saying!

@benjito

I think one could extend in all directions at the same time. If white and black “fill” a square at the same time, it ends up neutral in the final count.

This is functionally equivalent to getting the closest color (by manhattan distance) I think.

---

@martin3141

If this is supposed to be a Voronoi diagram, then why is M16 (the middle Hoshi point on the upper side) painted white in this diagram? Clearly the closest stone is F16 which is black.

I think if you look at the algorithm, you will see why it’s not as you expect (i.e. not totally reflective of the closest color) around the edges. Weak score estimator and Japanese rules - #38 by stone.defender for a description. The algorithm I suggested above (flood in all directions at the same time) should fix that.

---

@martin3141

How does your algorithm handle ties?

@stone.defender says it’s a bad idea, but I still think ties should be marked neutral!