Author: Stuart Cracraft
Date: 07:45:29 07/31/04
Go up one level in this thread
On July 30, 2004 at 01:17:49, Volker Böhm wrote: >Hi, > >I use an idea I got from crafty or gnu-chess. Use two consecutive hash entries >for one index. The first entry is a replace if deeper, the second entry is a >replace allways. > >Thus when adding an entry I calculate Index &= (~1); Then I check if the entry >at this index has been calculated with less depth. If yes put the new Entry at >the Index and the old entry at Index + 1. If not just replace the Entry at Index >+ 1. > >This works pretty well! > >Greetings Volker What are your results for %-of-nodes reduction?
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.