Author: Rafael Andrist
Date: 07:59:08 05/13/02
Go up one level in this thread
On May 13, 2002 at 09:43:03, Vladimir Medvedev wrote: > >> - did you check the key with a non incremental verification function? > >Yes, I have checked it and compared incremental and non-incremental variants >carefully. Captures, en passants, promotions and castling are processed >correctly :) > >> - do you store things like >> a) bound >> b) depthleft to search >> c) score of search > >I store the following set of data in each hash entry: > >* full 64-bit key >* depth >* entry type (alpha, beta or exact eval.) >* evaluation Are you sure you store the remaining depth? Check also if you handle this correct when using extensions. For move ordering combined with Iterative Deepening, you may also store the best move. regards Rafael B. Andrist
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.