Author: Uri Blass
Date: 06:44:04 01/01/04
Go up one level in this thread
On January 01, 2004 at 08:37:03, Sune Fischer wrote: >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. There is a need to do it to verify that the number is the same. It is possible that you have a bug that cause the program to be right in the first time but wrong in the second time because of some varaible that was changed. Uri
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.