1As with other Pseudo-Random Number Generator (PRNG) algorithms like the
2Mersenne Twister (see Math::Random::MT), this algorithm is designed to
3take some seed information and produce seemingly random results as output.
4
5However, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has
6different goals than these commonly used algorithms. In particular, it's
7really fast - on average, it requires only 18.75 machine cycles to generate
8a 32-bit value. This makes it suitable for applications where a significant
9amount of random data needs to be produced quickly, such solving using the
10Monte Carlo method or for games.
11
12WWW: https://metacpan.org/release/Math-Random-ISAAC
13