This project implements Langton's ant, a cellular automaton devised by Chris Langton in 1986. a cellular automaton with multi-state cells (0-8) that simulates a gradual dying process. The rules are based on neighbor counts:

• A cell becomes fully alive (state 8) if it has exactly one living neighbor (state 8).
• A living cell remains alive if it has exactly two living neighbors.
• Otherwise, the cell's state decreases by one (simulating gradual death).