Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Initial Position Search Nodes

Author: Dan Newman

Date: 13:19:44 10/09/00

Go up one level in this thread


On October 09, 2000 at 09:24:08, Steve Maughan wrote:

>OK so here’s a middlegame position - nothing special.  It’s actually AnMon v
>Ikarus the games move was Rd2 but there doesn’t seem to be too many tactics
>flying about.
>
>[d]r1br2k1/1pq2pbp/2p3p1/p1n5/2NN4/4P1P1/PPR1BPP1/3Q1RK1 w - - 0 21
>
>So my program (it has no name) takes 70 seconds and uses 17,059,562 nodes to
>complete the _eighth_ ply.  There are also only 3.3% of nodes where there are a
>hash hit – a bit low maybe?
>
>Other programs:
>
>Faile 56 secs and ~4,600 kn
>Crafty 17.11  9 secs and ~1,500 kn
>Ikarus 22 secs and ~2,900 kn
>Goliath Light 8 secs and 1,800 kn
>HIARCS 7.32 36 secs and 1,692 kn
>Nimzo 7.32 6 secs and ~1,700 kn
>ExChess 3.11 9 secs and ~1,200 kn
>
>Clearly there is something wrong with my program or is this what one would
>expect from a young vanilla alpha / beta?
>
>Steve Maughan

Mine (Shrike) is doing this in just under 3s (1.27M nodes) on a P3/600.
It's getting about a 35% hit rate on the hash table, so this may well
be the problem.  Those hash table moves are really important in getting
good move ordering (and a low branching factor).

I also keep stats on the fraction of cutoffs from the first move tried
and the fraction that are from hash table moves.  In this case I'm
getting 92% of the cutoffs from the first move and 25% from the hash table.

-Dan.



This page took 0.01 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.