Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: MTD(f), Quiscient Search, and hashing Quiscient nodes

Author: Omid David Tabibi

Date: 10:56:22 01/19/03

Go up one level in this thread


On January 19, 2003 at 13:48:55, Andrew Williams wrote:

>On January 19, 2003 at 10:59:46, Joel wrote:
>
>>Thanks for your reply Andrew.
>>
>>Hashing seems to work better for me too, though I have some fears about filling
>>up the hash table with a whole lot of rubbish. My thoughts are pretty much
>>directed at trying to think of a replacement scheme I am happy with.
>>
>>Joel
>
>I should have mentioned that I only store in the first two or three plies of the
>qsearch. And the entries get negative drafts, so they don't hang around too
>long.
>

I always store q-nodes (put them as depth 0). By storing only 2--3 plies of
q-search, how much do you save?


>Andrew



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.