Author: Martin Bauer
Date: 11:02:58 10/17/02
Go up one level in this thread
On October 17, 2002 at 09:18:02, Vladimir Medvedev wrote: >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... I have not checked it out, but I don't expect much from it, because capturing moves are will be selected first by move ordering anyway. Bye 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.