A cellular automaton consists of a lattice (consisting of cells), states, rules (which determine the next state of each cell), and a neighborhood (the surrounding cells that each cell uses in determining its next state). A standard cellular automaton advances at a discrete time interval, and changes every cell concurrently; however, we can consider cellular automata in which only a specific cell is chosen, and it, along with its neighborhood, is changed based upon the rules of the automaton. Thus, we can consider a game in which two players take turns attempting to cause the cellular automaton to achieve some specific configuration, although this configuration is possibly different for each player. My project will investigate such cellular automata, specifically ones with tic-tac-toe like winning formations (a win is created by achieving some number, say five, of one state in a row).
