Author: Jaime Benito de Valle Ruiz
Date: 10:47:20 12/12/03
Go up one level in this thread
Does your program use hash tables in perft to store just nodes for a given depth? Maybe for low depths using hash tables does not compensate for the extra processor cicles, but maybe for higher depths is ok considering all the transpositions that will occur in the tree. Ok, I'm probably re-descovering the gunpowder again and maybe everybody knows this already... but the perft in my program does NOT use the hash tables (although it update them with every "make"); it just verifies the correctness of the move generator and the make/unmake functions. I guess that using more hash memory in Sharper reduces the analysis time so much... otherwise it makes no sense. Just wondering, Jaime
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.