Author: Amir Ban
Date: 04:41:29 10/18/98
Go up one level in this thread
On October 18, 1998 at 05:46:50, Ed Schröder wrote:
>Since ages I use the following formula for creating a set of random
>integers for hashing at program start:
>
>#define LENGTH 64*12
>
>int random [LENGTH];
>
>int a,b,c,d,x;
>
>srand(9); // initialize prime number
>
>for (x=0; x<LENGTGH; x++)
> { a=rand(); b=rand(); if (b & 1) a=a | 0x8000;
> c=rand(); d=rand(); if (d & 1) c=c | 0x8000;
> random[x]=(a<<16)+c;
> }
>
>I wonder how good such a system is and how others do it.
>
>- Ed -
From the definition of LENGTH I guess these are piece-square tables you are
generating.
I do the same, but I generate 48-bit numbers (actually only 45-bit, because I
don't bother completing the MSbit), not 32-bit as you do. I think it's generally
acknowledged that 32-bit is not enough ?
Amir
This page took 0.01 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.