What I do is simply brute force the algorithm. That is, pick a seed at the beginning, then repetitively call the routine to generate random numbers and log them in memory. What we are looking for is when the pattern repeat itself. The longer it is, the better, so it's more difficult to predict. Note that this sequence is the result of the original seed, and the random mathematical function algorithm.

If the log shows the same value that repeats itself, then the mathematical function is less than par. This is why weak random number generator algorithms require that the seed be regularly refreshed by the timeclock (or some other external event like a key pressed on the keyboard) for the repeat pattern or stuck sequence to be less predictable. For telecommunication, encryption, or a casino slot machine, this is a vulnerability.

No random number generator is perfect. This is why we call them Pseudo Random Number Generators.

Dominique.