Computer Chess Club Archives

Search

Messages

Subject: Re: hashing in QS

Author: Richard Pijl

Date: 00:40:28 10/20/04

Go up one level in this thread

On October 20, 2004 at 02:27:19, martin fierz wrote:

>The question i have is this: should i stick
>with two separate tables for QS and main search? or should i just use a single
>big table (seems more sensible to me). or should i do no hashing at all in QS?
>any opinions on this?

I've experimented with a separate qsearch hash of different sizes, but it didn't
work out for the Baron. A combined hash was better everytime.
In the Baron I'm both storing and retrieving hash entries. I guess it works for
me due to my fat qsearch and slow evaluation function, so it may be different
for you.
Richard.

• Re: hashing in QS Alessandro Scotti 04:03:31 10/20/04
  • Re: hashing in QS Richard Pijl 04:51:07 10/20/04
• Re: hashing in QS martin fierz 01:37:54 10/20/04

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.