In preparation for a presentation, I wrote a quick program to show the cellular automata rule for Langton's Ant. Basically, if the "ant" is over an ON pixel, the ant turns right, if it is on an OFF pixel, the ant turns left. Then the ant inverts the pixel and moves a pixel in the new direction. It leads to some very complex patterns and has been used to make pseudo-random number generators. I left it running for over 2.5 million iterations yesterday and it was still chaotic (with 1 ant). Try watching 2 ants over time
This is a Grammer program and the world is 64x64 pixels, and is toroidal (basically, the world wraps in all directions, so if you go off the edge of the screen, it wraps around to the other side).