Author: Uri Blass
Date: 03:20:11 10/17/02
Today my repetition detection is not done based on hash tables and I plan to do it faster by hash tables. After every makemove I calculate the new hash key for the hash tables but I do not have an array of all the hash keys and I use a global varaible __int64 zob to have the hash key. I plan to add an array zobkey[max_plies_of_game] for hash keys My question is what is faster: 1)Doing all the calculation on zob and after finishing them to do zobkey[hply]=zob; 2)Doing all the calculations on zobkey[hply] I guess that I am going to choose 1 because it is more simple and I guess that the difference in speed is less than 0.1% but I am interested to know what is faster. Doing all the calculations on zobkey[hply] seems to have one less arithmetic calculation but more array calls. 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.