On Mon, Dec 12, 2011 at 9:11 PM, Mark Higgins <migg...@gmail.com> wrote:
> I assume this is what the gnubg benchmark stuff is about btw? Comparing > probability estimates in a bunch of benchmark board positions against > rolled-out probabilities? How do you condense the many different cases into > a single number - ie sum( weight * difference^2 ) - how do you relatively > weight the different benchmark positions? > The gnubg benchmark database has the resulting position and rollouts of that for each possible move in given position. The net selects the best move, and the there is a error rate on each move. So, we don't care about the exactness of the absolute evaluation, we care about the relative evaluation between the moves (or resulting positions after each move). That is what makes it select good moves! Credit to Joseph for the gnubg bechmark database. -Øystein
_______________________________________________ Bug-gnubg mailing list Bug-gnubg@gnu.org https://lists.gnu.org/mailman/listinfo/bug-gnubg
