Author: Alvaro Jose Povoa Cardoso
Date: 11:39:17 05/04/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? Depth preferred gives a good speed up because those entries came from the upper part of the tree wich means they represent the result of a search of a bigger subtree. Beyond this I suspect there is quite a lot to do (invent) in order to improve hash table performance. I think the classic two tier scheme is too simple to be the best think there is and I also think chess programmers didn't give too much attention to hash tables advances and inovation. I really feel there's a lot to be done in this field. Best regards, Alvaro Cardoso
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.