Author: James Swafford
Date: 20:15:24 09/17/02
Go up one level in this thread
On September 17, 2002 at 22:40:07, Jon Dart wrote: Thanks Jon. BTW - why would an insert fail? I'm guessing you're doing a depth based replacement scheme. When you say a search was successful - does that mean you got a cutoff, or that the table had some information (useful or not)? Does that include nodes in which you don't get a cutoff, but perhaps a move? -- James >Arasan 6.0, 48MB hash, 10 second searches on an Athlon 1.3Ghz > >position 1: >1604159 regular nodes, 1394301 quiescence nodes. >1533786 searches of hash table, 721743 successful (47 percent). >816790 hash entries inserted, 255364 entries replaced, 71698 inserts failed. > >position 2: >3344019 regular nodes, 2288201 quiescence nodes. >3274753 searches of hash table, 2806112 successful (85 percent). >596774 hash entries inserted, 404515 entries replaced, 138078 inserts failed. > >position 3: >685910 regular nodes, 1738720 quiescence nodes. >682953 searches of hash table, 281800 successful (41 percent). >463883 hash entries inserted, 71849 entries replaced, 26934 inserts failed.
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.