Author: Ernst A. Heinz
Date: 13:02:43 06/17/98
Go up one level in this thread
On June 17, 1998 at 15:34:25, Robert Hyatt wrote: >How about this: > >Pick a position from the first 12 test cases, ignoring number one which >should never have been in the test, and then run the test position for >depth=1, then 2, then 3, then 4, and so forth, and publish the node counts >here. I'm fixing to do the same... in fact, here are my numbers for >position #5, from 1 to 10 plies deep: > > depth total nodes > 1 61 > 2 299 > 3 1,939 > 4 9.052 > 5 41,606 > 6 121,430 > 7 459,585 > 8 1,244,527 > 9 2,935,151 > 10 6,494,133 > >those are using a 12mb hash table (crafty) and a 3m pawn hash >table. the 10 ply search took 1:16 (all were run with one cpu). >these node counts are the *total* node counts, so the 10 ply >count includes all the ones before it, plus the nodes added by >the 10 ply iteration... "DarkThought" on 600MHz Alpha-21164a (numbers are nearly the same for hash sizes from 4MB to 128MB): 9 3,029,170 (11 sec) 10 4,960,696 (18 sec) 11 10,007,017 (36 sec) 12 25,739,833 (90 sec) =Ernst=
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.