Author: Gian-Carlo Pascutto
Date: 05:56:14 04/05/01
Go up one level in this thread
On April 05, 2001 at 06:54:30, David Rasmussen wrote: >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. Sjeng uses a seperate Qsearch hashtable. It's a gain everytime I test it. Even with SEE, because even though the hits are lower, the time saved is greater. -- GCP
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.