hgm wrote:What exactly does "reproducibly occasionally" mean?
Once in, say, 100 games played.
hgm wrote:More importantly, how was this win found?
I let the two play against each other using autoplay with default parameters. My engine does not do pondering and a very little bit of multithreading (top cpu usage is around 130%) so GNUChess can use continue 1 and most of the time almost 2 cpu cores (it is an intel e6600 system). 2GB of ram available with my engine using 400MB.
hgm wrote:If I commit a game where an opponent loses to book, only very few programs would randomize thoroughly enough to not occasionally play the same game again.
I'm not entirely sure what you mean but it lost after 36 moves so that is beyond the book. The logfile and then .pgn-file are available from my site by the way (
http://www.vanheusden.com/pos/examples/ ... os1.18.pgn and
http://www.vanheusden.com/pos/examples/ ... os1.18.log)
hgm wrote:Even a random mover would occasionally beat Rybka, as the probability it does all the right moves by accident is non-zero. (Just 10^-100 or so.)
True but my program wins around 1% of the games so I think that is beyond random chance, isn't it? Not sure, I'm not a statisticus.
hgm wrote:So a much more important question is: can Pos now 'reproducibly' beat N.E.G., in the sense that the reult is reproducible, not the moves.

Yes. In the last 24 hours (no continues play, had it play during lunchbreak and such) I saw it won at least 3 times.[/url]