Author: Vladimir Medvedev
Date: 06:18:02 10/17/02
Go up one level in this thread
>> >>IF (disnace < 0) THEN read/write Table2 ELSE read/write Table1; >> If you store the best move in hashtable entry, using common hashtable both for search and q-search may be reasonable. Because on the next depth iteration many q-nodes will become normal nodes, and stored best moves (captures from q-search) may help very well in move-sorting. Just my guess, I'm not confident too much...
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.