Author: Uri Blass
Date: 18:07:40 12/19/03
I am interested if programmers can do the following experiment. Take the GCP test suite(delete endgame positions from it) and test your program twice. one time with 1 mbyte hash tables and one time with 2 mbytes hash tables. of course 2 mbytes is better but the question is if 2 mbytes gives 6-7% speed improvement for all problems (except easy problems that are solved in less time that is needed for the program to fill the entries of 2 mbytes hash table) or if it gives bigger improvement for hard problems that the program needs some minutes to solve. I asked to use very small hash tables in order to enable programs to fill the hash tables in a very small time. I agree that bigger hash table probably means better branching factor at the time that is enough only to fill the small hash and not enough to fill the bigger hash but the question is what happens later. Uri
This page took 0.01 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.