Author: Jon Dart
Date: 06:48:23 09/18/02
Go up one level in this thread
On September 17, 2002 at 23:15:24, James Swafford wrote: >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. Yes. I use the standard scheme of a replace-always and depth-based hash table. Failure means the candidate position could not be put into the depth-based table. Replacement stats also apply to the depth- based table. > >When you say a search was successful - does that mean you >got a cutoff, or that the table had some information (useful >or not)? It just means a hit. It doesn't mean the stored info was useful.
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.