Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Initialization of pawn hash table

Author: Peter Fendrich

Date: 12:16:35 09/26/04

Go up one level in this thread


On September 26, 2004 at 14:47:09, Zach Wegner wrote:

>>I initialize the depth (draft) with -1. It takes essentially no time.
>>In the beginning I have, if depth == -1 then this is an empty entry.
>>
>>You could also use zero as initial value and test against zero.
>>It would miss all keys==0 but that wont hurt your programs strength...
>>Don't test if depth==0, that's not a good idea.
>>If you store an alternative key or part of the full 64-bit key in the
>>hash-entry, test against that instead.
>>/Peter
>
>I should have been more specific, this is in the pawn hash table and there is no
>draft. I'm thinking I might have to test against hashkey==0 in the pawn code,
>although this is not the sort of thing I like to write code for.
>
>Thanks,
>Zach

Well, I probably should have understood.
Anyway, when I add to the pawnhash I don't test anything, just replace what's
there.
When I retrive: if (word_1)==0 return empty;
I store 3 32-bits words for each entry and don't care about the extremely
special case key==0.

I have never experienced the problem you describe.
/Peter



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.