[TuringTest]

The Wikipedia article contains several variations, including that one. Check the external links for videos and programs.

Interestingly, multiple ants don't need conflict resolution, as two ants sharing the same cell will want to leave it at the same state.

https://en.wikipedia.org/wiki/Langton's_ant

[Kiro]

Thanks. I am actually looking for one with conflicting resolutions though and can't seem to find that in the links. Basically I want to make a game where you put out ants that compete somehow. Either the one with most converted tiles wins or if they can kill each other. It doesn't have to be Langton's ant specifically, just an algorithm that is as easy to understand.

[scrumper]

I haven't thought this through, but I think a simple extension which would generate conflict would be to incorporate the ant's last movement in determining the end state of the cell it's currently on. That way, two ants arriving in the same cell from different directions would want different results.