Author: Ed Murak
Date: 12:16:37 12/10/05
Go up one level in this thread
On December 10, 2005 at 14:59:36, Ernest Bonnem wrote: >Hi Ed, > >I did see your message (which is buryed now in the depths of our CCC-Rybka >Forum, so to be read I had to begin a new thread :-))), Hi Ernest, Yes, in the RCC (Rybka Chess Club) the scroll rate is very fast. But just wait till the results get known after EG knowledge and EGTBs are inserted - then the testers will be in a double-frenzy and the board scroll rate can again double! Almost every loss I see of Rybka against other engines is either from the non-Rybka book used or in the endgame... so the effect of fixing both can be a bit big. >but I just wanted to dig a little further. >Too bad you are so far the only one to respond! >But in your message http://www.talkchess.com/forums/1/message.html?467851 >you didn't say the "rounding down to whole seconds" Hint: "granularity". > and I can't see either your "nps ------> dev/null". dev/null is old programming jargon for the bit-bucket which is old programming jargon for the trashcan. I suggested not using nps, just use the "seconds". >Did I miss something? >And more importantly, what do you mean by: solution... nps ------> dev/null? Above. >The "granularity" you mention is clear, since the nps number is obtained by >dividing 3988843 by some "round" (integer) seconds (as low as 15 for Aaron, 52 >for my slow machine). >But I am also wondering why, by repeating my tries (more than 10), I obtain time >values ranging from 53.328 to 54.259. Who knows without decompilation/disassembly... or consulting source? Maybe a little bug in something. The author is aware. >This reminds me of the granularity of "timer" values in DOS/Basic (also >Windows?), of 1/18th of a second (55 msec).
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.