Computer Chess Club Archives


Search

Terms

Messages

Subject: Hash Tables

Author: Tor Lattimore

Date: 01:07:10 08/01/04


Hi
Over the past couple of days I have implemented MTD(f) in my program. It's
working quite well so far. I wrote a routine to collect my PV's from the hash
table, but have found that the even the root position occasionally gets
overwritten (when it finishes with a fail low). Up untill now I have used a
always replace hash scheme. To test I set my replacement scheme to replace if as
deep or deeper. This fixed my PV problem straight away, but reduced my
performance a little. Is the best strategy to have two tables with different
replacement schemes? or is there a better system I should use?
Thanks
Tor



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.