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 probabilities - well, if you modify them :-) ).
_______________________________________________ Computer-go mailing list [email protected] http://computer-go.org/mailman/listinfo/computer-go
