Author: Robert Hyatt
Date: 07:43:44 05/03/04
Go up one level in this thread
On May 03, 2004 at 08:34:55, Aivaras Juzvikas wrote: >my question is how big gain would be for me to transit from a simple always >replace scheme to two tier table with depth prefered and always replace schemes. >its probably hard to measure because not only the tree size will differ but also >the accuracy of suggestested score and hash move (depth prefered table results >are (?) more accurate than simple always replace table). > >also in such a two tier scheme, how does one divide the memory between these two >tables? should depth prefered table get less slots in memory than the other? It will make your search a bit more efficient. Any hash improvement will only help. Dividing memory is up to you. I use 3/4 of a power of two entries. 1/4 of them in depth-preferred table, 1/2 of entries in always-store table...
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.