We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Ant circuit
"ant circuit" is a cell-based language made by User:Nimeratus in 2026. It was inspired by Langton's ant.
Description
There is an "ant" that moves over a grid of colored cells. Each cell can be either obstructed (black) or unobstructed (any other color). Initially none of the cells are obstructed. The ant moves forwards until it reaches an obstructed cell. Then it turns right and moves a step ( even if it this way it ends up on an obstructed cell). When the ant leaves a cell by moving upwards, it becomes obstructed. When the ant leaves a cell by moving in any other direction, it becomes unobstructed.
The program consists of an image laid over the ant's grid, that overrides whether a cell is obstructed.
Output is possible by setting up areas where the ant can move through in different directions, changing the color.
Computational class
If we allow infinitely repeating patterns in the circuit, then the language is Turing-complete.
Examples
SR switch:
SET=done
^
RESET > . . #
TEST > . O . > TEST=0
# . . < SET
| v
v RESET=done
TEST=1
("#" means force-obstructed, "." means force-unobstructed, "O" means the ant can change it)
By sending the ant towards the corners, the state of the cell in the center can be changed. The ant steps on it while turning, so it doesn't check if the cell is obstructed. The state can be read by sending the ant directly towards the center. If the center is obstructed, it will redirect the ant, and if it isn't then it won't change its direction.