I have a question for the group: How is a miai connection strategy
created for a color enclosed region when their are multiple
enclosing blocks involved with one or more interior defender
blocks? Martin Muller's paper "Recognizing Secure Territories in
Computer Go By Using Static Rules and Search" doesn't go in
sufficient detail for my understanding. At first it seems obvious,
especially given the example; however, given a different example
where there are more than one possible miai strategy, does it
matter which one is used before generating another miai strategy
for protecting interior defender blocks? I hope the answer is no.
But if so, is there an optimal way to generate the miai connection
strategy? I'd appreciate any references to other papers on the
subject.
Hello Phil,
Unfortunately, I do not know of an optimal way - unless you want to
do a backtracking search. There may be different ways to set up miai
strategies to the same interior point or block - especially if it is
a large block. I just use some simple heuristic that orders the
access points, such that those that can not help to access other
interior points are used up first. I.e. sort by number of interior
neighbor points, and use the ones with low count first.
Erik v.d.Werf has a recursive improvement on my original 1-level
scheme - I believe it was posted here. We are also using that one now.
Martin_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
