Mersenne Twister  From Wikipedia, the free encyclopedia Jump to:
navigation, search  The Mersenne Twister is a pseudorandom
number generator (PRNG). It is by far the most widely used
PRNG.[1] Its name derives from the fact that its period length
is chosen to be a Mersenne prime.  The Mersenne Twister was
developed in 1997 by Makoto Matsumoto (松本 眞?) and Takuji
Nishimura (西村 拓士?).[2] It was designed specifically to rectify
most of the flaws found in older PRNGs. It was the first PRNG to
provide fast generation of high-quality pseudorandom integers.
The most commonly used version of the Mersenne Twister algorithm
is based on the Mersenne prime 219937−1. The standard
implementation of that, MT19937, uses a 32-bit word length.
There is another implementation that uses a 64-bit word length,
MT19937-64; it generates a different sequence.  Adoption in
software systems[edit]  The Mersenne Twister is the default PRNG
for the following software systems: R,[3] Python,[4][5] Ruby,[6]
PHP,[7] CMU Common Lisp,[8] Embeddab