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/
