Maybe it would be good enough to only update the string criticality first.
More expensive calculations for the found critical strings could kick in
later.
You asked for a formula, and I tried to comply, but its really only
conceptual.
Also there will still be points that are good for both, taking a liberty or
extending by 2 liberties for example.
The central idea would be to discourage permutations of dame-filling moves.
The ordering criterea might not have to be so precise.
Stefan
----- Original Message -----
From: "Yamato" <yamato...@yahoo.co.jp>
To: "computer-go" <computer-go@computer-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(X): x_not_empty_count / N
P(X|C): x_not_empty_when_string_captured / string_captured_count
value 0: perfect defense
value 1: perfect offense
Well, it should work theoretically but seems very expensive for the
processor. When we have this information, do we have to update every
node value for every string every time?
--
Yamato
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
