-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
I have a probability table of all possible moves. What is the fastest
way to pick with probability, possibly with reducing the quality of
probability?!
I could not find any discussion on this on computer-go, but probably I
missed it :(
Thansk a
> I have a probability table of all possible moves. What is the
> fastest way to pick with probability, possibly with reducing the
> quality of probability?!
>
> I could not find any discussion on this on computer-go, but probably
> I missed it :(
I may have misunderstood the question, but there
In case the question is more on the computational part, you might
use a binary tree, so that you do the selection in time O(log(number of
moves))
instead of O(number of moves). The update is also in logarithmic time for
some probability update rules (to be discussed, depends on how you modify
your
