Author: Moritz Berger
Date: 06:57:17 05/02/98
Go up one level in this thread
On May 02, 1998 at 05:39:55, blass uri wrote: >the relevant position is >r4rk1/2p3pp/p7/1p1pq3/8/2P2N2/PPQ2KPP/R1B5 >black to move > >if fritz5 uses 9984Kbytes hash tables >it needs to calculate 258299 knodes to see Kg1 loses >and after calculating 335276 Knodes find Qd3 as better move >at depth 15. >if fritz uses 99840Kbytes hash tables it does not find at depth 15 >Kg1 loses and needs to calculate 993,447 Knodes to find >the move Qd3 that is found only at depth 16 The whole search is different with bigger hash tables ... Sometimes Fritz simply cuts of an extension much earlier with smaller hash tables, but this might well be a case of "playing the right move for the wrong reasons", i.e. within the limitations of the evaluation function I expect Fritz to find the "better" move more reliably with bigger hash tables, even if this means it takes longer because a cut-off due to hash table collision is not effective with the smaller tables. Moritz
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.