Generate sequences of pseudo-random numbers using one of two algorithms (see below)

Pseudo-random number sequences are generated using one of two algorithms:

- The GJ Mitchell & DP Moore algorithm from The Art of Computer Programming vol 2 Seminumerical Algorithms 2nd edition by Donald E Knuth. This uses integer modulo arithmetic to seed the generator then subtractive combination to generate sequences in the range 0 <= x < 10e9. This implementation uses the number pair (24, 55). Other successful pairs include (32, 65) and (27, 98).
- The Mersenne Twister algorithm from the C implementation © Makoto Matsumoto and Takuji Nishimura 1997-2002. Use and distribution is subject to conditions that the copyright, conditions and disclaimer must be propagated. The copyright holders and contributors do not endorse derivative products and disclaim express and implied warranties and liability of any nature from use even if notified. This generates unsigned 32-bit integer sequences.