Author: Robert Hyatt
Date: 12:34:25 06/17/98
Go up one level in this thread
On June 17, 1998 at 14:14:08, Peter McKenzie wrote:
>Greetings,
>
>In a recent post Bob Hyatt posted the following results for the Bratko Kopec
>test, using Crafty to search all positions to a fixed depth of 9 plies:
>
>Positions Searched...... 24
>Number right............ 19
>Total Nodes Searched.... 34,195,500
>
>I tried this on my program lambChop, and got the following results:
>
>Positions Searched...... 24
>Number right............ 18
>Total Nodes Searched.... 232,925,032
>
>So my program searched almost 7 times as many nodes!
>
>What sort of numbers do other programs give?
>Is Crafty's node count typically pretty low compared to others?
>
>Maybe mine has some bugs, or maybe I'm doing too many extensions or maybe
>my q-search is too big, or ....
>
>My search uses R=2 null move pruning, or at least its supposed to :-)
>Transposition table size was 0.5 million entries.
>
>I'm not sure what the standard way of counting nodes is, this is how I
>do it: I increment my node count in my MakeMove routine, so my node count
>includes the q-search. I don't count nullmoves as I have a separate
>MakeNullMove routine.
>
>cheers,
>Peter
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...
Bob
This page took 0.03 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.