Author: Colin Frayn
Date: 06:14:17 06/21/01
Go up one level in this thread
On June 20, 2001 at 07:35:24, Uri Blass wrote: >Is there another program (with free or without free source code) that can >calculate perft (without hash) faster than Crafty? Until recently Beowulf was about 5% faster than Crafty using exactly the same algorithms (rotated bitboard, counting true nodes). I recently added in hash key updating code into the DoMove() function, which is not needed for perft, but which is useful for the search() function. That makes it quite a bit slower. I'm not sure why I bothered - the total improvement is only a couple of percent in overall search speed. I suppose I could take it out again, or make a separate DoMove function for the perft function, but it doesn't seem worth it. Cheers, Col
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.