Recognizing the Repeatable Configurations of Time-Reversible Generalized Langton’s Ant Is PSPACE-Hard

• Main Authors: Takeo Hagiwara, Tatsuie Tsukiji
• Format: Article
• Language: English
• Published: MDPI AG 2011-01-01
• Series: Algorithms
• Subjects: cellular automata; computational complexity; Langton’s ant; Lorentz lattice gas; PSPACE-hard
• Online Access: http://www.mdpi.com/1999-4893/4/1/1/

Chris Langton proposed a model of an artificial life that he named “ant”: an agent- called ant- that is over a square of a grid moves by turning to the left (or right) accordingly to black (or white) color of the square where it is heading, and the square then reverses its color. Bunimovich and Troubetzkoy proved that an ant’s trajectory is always unbounded, or equivalently, there exists no repeatable configuration of the ant’s system. On the other hand, by introducing a new type of color where the ant goes straight ahead and the color never changes, repeatable configurations are known to exist. In this paper, we prove that determining whether a given finite configuration of generalized Langton’s ant is repeatable or not is PSPACE-hard. We also prove the PSPACE-hardness of the ant’s problem on a hexagonal grid.