Author: José Carlos
Date: 17:44:56 12/25/01
Go up one level in this thread
On December 25, 2001 at 20:21:49, Sune Fischer wrote: >I'm sitting here with an implementation problem, I can think of a few ways to >solve it, but perhaps there is an even better one. > >The problem is I can't always get the best move in a position when searching, I >need a beta cutoff or an improvement in the alpha value. So it isn't save for me >to assume there is killer in all recorded hash entries, and if I only >recordhash() when I _can_ put a killer in, then I miss out on some scores. > >So I was wondering what solution you guys have found? > >-S. I don't understand exactly your question. I think you mean you don't hash every position, but only when you fail high. I hash every position. Fail low information is also useful. Also, I use the two level hash table: one depth best and one always replace. José C.
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.