AI authored to showcase ironpad capabilities.

Langton's Ant

Langton's Ant is a two-dimensional Turing machine with remarkably simple rules that produce surprisingly complex behavior. Invented by Chris Langton in 1986, it operates on a grid of black and white cells.

Rules

The ant follows just two rules based on the color of its current cell:

1. On a white cell: Turn right 90°, flip the cell to black, move forward.
2. On a black cell: Turn left 90°, flip the cell to white, move forward.

Emergent Complexity

Starting from a blank grid, the ant's path appears chaotic for the first ~10,000 steps, creating a seemingly random blob. Then, suddenly, it begins building a diagonal "highway" — an infinitely repeating pattern of 104 steps that carries the ant away in a straight line.

This abrupt transition from chaos to order is one of the most striking examples of emergent behavior in simple systems. No one has proven why the highway always appears.

This Notebook

We simulate 12,000 steps on a 200×200 grid. Black cells appear dark, and the ant's current position is highlighted in red.

The Highway Phenomenon

After approximately 10,000 steps of seemingly chaotic wandering, the ant discovers a periodic diagonal highway and begins extending it indefinitely. This highway:

• Has a period of 104 steps — after 104 moves, the pattern repeats, shifted diagonally.
• Emerges regardless of starting conditions (as far as anyone has tested), though the onset time varies.
• Remains unproven — no mathematical proof explains why the transition always occurs.

The messy region in the center is the initial chaotic phase. The diagonal stripe extending from it is the highway.

Try Modifying

• Increase the step count to 50,000+ to see a longer highway.
• Try starting on a non-blank grid (random initial cells) — the highway still emerges!
• Implement multi-color extensions (e.g., "LLRR" or "LRRRRRLLR" rule strings) for dramatically different behavior.