I'd like to implement RAVE as described in [1]. I believe I have a very clear understanding of how to do this at the leaves of the UCT search tree. What I'm not sure about is how to apply RAVE results higher in the UCT tree. Does anyone have any experience with this that they're willing to share?
[1] http://www.machinelearning.org/proceedings/icml2007/papers/387.pdf
_______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
