Author: Carsten Kossendey
Date: 04:34:02 03/19/98
Go up one level in this thread
On March 19, 1998 at 06:23:45, Roland Pfister wrote: >On March 19, 1998 at 02:24:55, Christophe Theron wrote: > >>On March 18, 1998 at 22:25:24, Robert Hyatt wrote: >> >>>here's crafty running on my notebook, default (small) hash and all: >>> >>> depth time score variation (1) [snip] >>> 4 0.08 ++ 1. Rd1+!! [snip] >>> 9-> 0.73 Mat07 1. Rd1+ Rg1 2. Rf1 a5 3. bxa5 b4 4. >>> a6 Rxf1+ 5. Kxf1 b3 6. a7 b2 7. >>>a8=Q# >>> time: 0.74 cpu:83% mat:-2 n:51447 nps:10000 >> > >something is wrong here: >51447 nodes in 0.74 seconds is never 10000 nps rather 70000 nps. >or should it be 5.14 seconds ;-) > >>If Crafty does only 10000 nps on your notebook, this computer is quite >>slow. So Crafty is probably the best program so far on this position, > ^^^^ >see above Crafty does not compute a nps value if the search took less than 1 sec. In that case the nps from the last search is used. If no last search exists (i.e. you just launched it) a predefined value is used instead.
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.