Tom suggested I post to here as we didn't look at it in the meeting:
The linear formula described on page 50, `x_next = (k * x + c) mod m`, is a poor generator for 'random' numbers. Their sequences have repeated loops which often appear quickly, usually with a (relatively) low period. It reminded me of an entropy visualization a friend described to me a while back.
The simulation generates a load of `worms`, each with their own set of values for (k, m, c, x0) and uses their generated sequences to influence their movements.
Due to their short repeating sequences, the worms get stuck in loops which you can see as them moving in patterns. Their movement also (generally) tends towards the edge of the screen as their repeated loops don't have a balanced number of Left, Right, Down and Ups. I think this highlights the lack of a uniform distribution within the loops of the generated sequences.
http://ryman.github.io/new-turing-omnibus/8%20-%20Random%20Numbers/random_walks.html