Author: Tim Mirabile
Date: 21:59:09 01/14/00
Go up one level in this thread
>>rand() is evil. It uses a linear congruency method like >> >> new random number = (old random number * constant + constant) % constant >> >>Information in low bits of 'old random number' is lost in this formula. Since >>the number of seconds since 1970 is pretty much constant in lets say January >>2000, the random numbers produced will be quite similar... Would it help to reverse the order of the bits in the seed, then shifting off any and all trailing zeros?
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.