Date: 1999-11-05 15:49:42
> A basic uniform random generator and a set of transformation
> convert to a different distribution.
> It may be better to separate the two functions such that any rand can
> used with any transformation function.
I like this idea. Using templates to maintain orthogonal
decomposition, with different uniform prng passed to the transformation
> It may be prudent to provide several test routines to test both the
> generators and the transformation functions. (against other MT
> implementations such as the one suggested above?)
The original C-source code for the Mersenne Twister is available at:
You can use this to test the sequences of your MT19937B for accuracy.
Actually, the algorithm has a homepage. But I've never managed to get
to it --I connect to the server, but cannot download a thing. It's
been that way for a week. The links I gave above are the original
source code maintained at a different site.
If you are interested in testing the worth of the algorithm itself (or
any others), then you might be interested in Marsaglia's diehard
battery, which appears to be the benchmark of choice for prng's
Warning -- it requires something like 10 - 12 million numbers generated
The MT19937B has passed all the diehard tests. A full report can be
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk