Author: Tony Werten
Date: 01:06:13 12/07/04
Go up one level in this thread
On December 07, 2004 at 00:12:34, Michel Langeveld wrote: >I probe the hashtable in QSearch with depth 0, and store qsearch nodes with >depth 0 into the hashtable in my program Nullmover. If the move is above beta >then I produce a cut off immediatly. Why not also when it is below alpha or exact ? Tony > >In all QSearch nodes I generate the captures/queen promotions and then >selectsort these moves. If a move is the same as the hashtable move then I sort >at the top of the list. > >This seems to work in allmost all positions slightly (10%) faster then when I >don't use hash in QSearch at all. > >Michel
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.