I wrote a graphical Langton’s ant simulator in C using the SDL library. It is able to run the simulation at configurable speeds and board sizes.

If you read about Langton’s Ant, you might read that after a certain number of steps, it goes into a very short and repetitive cycle. This is because those simulations are on an infinite grid that expands as the ant moves. If you make a rectangular grid and make the edges wrap around (going off the left edge teleports the ant to the right etc.) you will find the behaviour much more chaotic.

While very slow and inefficient, I think it should be possible to make a PRNG algorithm that uses Langton’s Ant as the state and mixer.