Author: Sune Fischer
Date: 05:37:03 01/01/04
Go up one level in this thread
On January 01, 2004 at 02:48:22, Russell Reagan wrote: >"Fast perft" is when someone calculates perft, but they use some tricks to >speedup the calculation, such as using hash tables to store previously computed >results (just like how the transposition table works). "Fast perft" has a >purpose, but not for this discussion. It would be useful if someone is >calculating perft to a high depth, and they wanted a fast perft calculator. > >"Fast perft" doesn't really compare the speed of the movegen/make/undo routines, >and it doesn't help you to debug your search. Of course it helps you to debug, think about it. A hash hit just saves you a perft calculation of the same position to the same depth. You've already counted this number, either it is correct or not but there is no need to perform exactly the same task again. One could even say that with a hash you get to debug your zobrist keys at the same time! :) You are right though that it is useless for speed comparisions with tricks like that, but some might use attack tables or other kinds of incremental eval which would make the program seem really slow. My old program using attack tables is almost 8 times slower in perft than my new version not using them, but their search speeds are within 20% of eachother, on some positions the old is even a few percent faster! Unless it's a straight up comparision of the same type of move generator then I don't see how one can compare. -S.
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.