Author: macaroni
Date: 19:19:04 11/25/03
is it usefull to use hash inside the quiescent search? if so, should one use a different table, smaller? larger? it is obvious that the quiescent hash cannot be used for actual returns in the main search, but perhaps it can be used for move ordering (there might be a large number of 'hits' form previous searches). And I supose the main search hash can be used in the qsearch too if desired. Is this all worth the memory? (and time for lookups and stores), or would I do better to use my memory on say, another hash table insearch so I can have better replacement schemes? thanks
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.