Does this only work when using RAVE/AMAF?
Peter Drake http://www.lclark.edu/~drake/ _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
There has been some talk here of using a zero exploration coefficient.
Does this literally mean using the win ratio (with one "dummy" win per
node) to decide paths through the MC tree? It seems that the best move
could easily be eliminated by a couple of bad runs.
- [computer-go] Zero exploration? Peter Drake
- Re: [computer-go] Zero exploration? Magnus Persson
- Re: [computer-go] Zero exploration? Olivier Teytaud
- Re: [computer-go] Zero exploration? Álvaro Begué
