Rémi Coulom offers a formula for the criticality of point x.
(Criticality: a Monte-Carlo Heuristic for Go Programs)
Criticality being a measure of how important holding x is for winning.
c(x) = v(x)/N - (w(x)/N * W/N + b(x)/N * B/N)
N: number of playouts
W/B: playouts won by white/black
Stefan Kaitschick wrote:
There would be 2 levels of criticality:
1. How important is the string for winning the game?
2. How important are points in the vicinity for attacking/defending this
string?
(possibly with ordering information)
Few months ago I tested it without success.
String
Few months ago I tested it without success.
String criticality seems a nice idea, but how should it be implemented?
Just giving high priority to the liberties does not work, because that
cannot be distinguished from the simple dame-filling.
Can you suggest a concrete formula?
--
Yamato
a shot
-go.org
Sent: Monday, September 14, 2009 5:08 PM
Subject: Re: [computer-go] string criticality?
Stefan Kaitschick wrote:
something like this(a little Bayes):
P(C|X) = P(X|C) * P(C) / P(X)
P(C|X): chance that the string will be captured if x is played by any side
P(C): string_captured_count / N
P
Maybe from a different angle, but maybe you remember me writing about
'stone-age'. Basically what it did was assuming strings created during
the playout are less critical than existing strings. I used this to
limit my tactical search by a great deal by not doing any search on
'new' strings. This
Stefan Kaitschick wrote:
There would be 2 levels of criticality:
1. How important is the string for winning the game?
2. How important are points in the vicinity for attacking/defending this
string?
(possibly with ordering information)
I like this idea. I'd also forgotten about the point
