Author: Jaime Benito de Valle Ruiz
Date: 04:57:15 06/21/04
Would it be a good idea to store an entry with the game move at the root of the search? The idea, of course, is to use it to determine whether a hash entry belongs to a previous search, and it probably should be replaced even if it has a higher number of nodes/depth because it could have become obsolete. I think some engines actually set a flag for every hash entry before or after every search to mark them as "old", but this doesn't sound like a good idea for quick games if you want to use a lot of hash. Any suggestion/comments? Thanks, Jaime
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.