Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Transposition table replacement.

Author: Volker Böhm

Date: 22:17:49 07/29/04

Go up one level in this thread


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



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.