**Class Summary** |

**MersenneTwister** |
The `MersenneTwister` class is a consistent 64-bit alternative
to Java's built-in java.util.Random class. Although it doesn't offer
all the same methods, the key methods included provide simple and reliable
long-sequence pseudo-random number generation. Steps have been taken
in this algorithm to minimize processor overhead, and to ensure the
sequence is not repeated for as long as possible (all pseudo-random number
generators suffer from the same problem in that the generated sequences
eventually repeat). |

**XORShift** |
The `XORShift` class is a consistent alternative to Java's
built-in java.util.Random class. Although it doesn't offer all the
same methods, the key methods are provide simple and reliable long-sequence
pseudo-random number generation. Steps have been taken in this
algorithm to minimize processor overhead, and to ensure the sequence is not
repeated for as long as possible (all pseudo-random number generators
suffer from the same problem in that the generated sequences eventually
repeat). |

**XORShiftZ** |
The `XORShiftZ` class is a consistent alternative to Java's
built-in java.util.Random class. Although it doesn't offer all the
same methods, the key methods are provide simple and reliable long-sequence
pseudo-random number generation. Steps have been taken in this
algorithm to minimize processor overhead, and to ensure the sequence is not
repeated for as long as possible (all pseudo-random number generators
suffer from the same problem in that the generated sequences eventually
repeat). |