Author: Zach Wegner
Date: 07:48:22 12/10/03
Go up one level in this thread
On December 10, 2003 at 07:10:37, Albert Bertilsson wrote:
>On the 2GHz P4 (not the fastest machine, but the one I use right now) Sharper
>get 18Mnps. What makes the numbers look so good is of course the usage of hash
>tables, without them it would be a whole diffrent story.
>
>/Regards Albert
I've always wondered how exactly to implement a perft hash table. I was thinking
a large struct with several node counts:
typedef struct
{
UINT64 hashkey;
unsigned int perft3;
unsigned int perft4;
unsigned int perft5;
unsigned int perft6;
unsigned int perft7;
unsigned int perft8;
/*and so on...*/
} PERFT_HASH;
with perft 1 and 2 removed because they should be very fast. What does yours
look like?
Regards,
Zach
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.