Author: Martin Bauer
Date: 23:13:11 11/25/03
Go up one level in this thread
On November 25, 2003 at 22:19:04, macaroni wrote: >is it usefull to use hash inside the quiescent search? I do it. >if so, should one use a different table, smaller? larger? I use one table for all >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). because of that in qsearch I am only reading from the table. To get into the table a positions distance must be at least greater then zero. Martin
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.