Computer Chess Club Archives

Search

Terms

Messages

Subject: Qsearch

Author: David Rasmussen

Date: 03:54:30 04/05/01

I know that most people (including me) do not store results in the hashtable
during Qsearch, because there are too many positions to keep, and valuable
positions closer to the root would get overwritten etc.

But have anybody tried a seperate Qsearch hashtable? The very fact that the
Qsearch generates so many notes, and so much time is spent there, seems to
dictate that the dynamic programming principle of a trans/ref table would be
very beneficial here too.

Re: Qsearch Tony Werten 12:47:50 04/06/01
Re: Qsearch Andrew Williams 12:32:06 04/06/01
- Erk! What am I talking about? (was Re: Qsearch) Andrew Williams 13:21:45 04/06/01
Re: Qsearch Matt McKnight 02:23:24 04/06/01
Re: Qsearch Gian-Carlo Pascutto 05:56:14 04/05/01
- Re: Qsearch Miguel A. Ballicora 09:05:31 04/06/01

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.