Author: Larry Griffiths
Date: 10:37:20 09/06/00
Go up one level in this thread
On September 06, 2000 at 11:06:42, Philipp Claßen wrote: >Hi! > >I want to add a extra transposition table for quiescence search to my own >program. But I´m not sure how to avoid that important entries are overwritten by >less important ones. In a normal search the distance is a good criterion but in >a quiescence search? Perhaps the current ply? > >Phil I also plan on extending my hash table to work with quiescence or extended (selective) plys. It was easy to calculate the depth from the leaf with a fixed depth, but I will have to try something different with variable depths. Larry.
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.