Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashtables and iterative deepening (question)

Author: Vincent Diepeveen

Date: 07:09:57 05/13/02

Go up one level in this thread


On May 13, 2002 at 10:01:49, Vladimir Medvedev wrote:

>
>>>I store the following set of data in each hash entry:
>>>
>>>* full 64-bit key
>>>* depth
>>>* entry type (alpha, beta or exact eval.)
>>>* evaluation
>>
>>you must store the search score, so alfa or beta. Not the evaluation.
>>
>
>Of course, I store beta when cut-off :)
>But the structure field name is "eval" :)))

Then it's time to debug your code a little!

Can you write verbose search files which print for every
variation and every action undertaken into a logfile?





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.