Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: 64-Bit random numbers

Author: martin fierz

Date: 15:23:41 10/31/03

Go up one level in this thread


On October 31, 2003 at 15:12:35, Dieter Buerssner wrote:

>On October 31, 2003 at 05:14:03, martin fierz wrote:
>
>>On October 30, 2003 at 16:27:18, Dieter Buerssner wrote:

>>BTW you mention that you do hashing in QS in yace. since i don't do this in my
>>program: how much does this help? should i try? (of course the answer to this
>>question is yes, as one should always try... but how much in % would you
>>estimate that you gain by using hash in QS?)
>
>Sorry, I have no estimate in % anymore. I did test it, however. First I was
>surprised that using hash in QS will help even in situations where the HT is
>totally overfilled (long searches). I guess, it might have to do with the fact,
>that I don't use SEE. So the benifit might be bigger than in an engine that uses
>SEE.

interesting stuff. my program has no SEE either - i always get a headache when i
try to think how to do it :-)
so i'll have to try that hashing in QS thing, specially since christophe just
wrote that getting one's QS right is 30% of the effort spent on creating a good
chess program...

cheers
  martin



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.