Exhaustive exploration of Prisoner's Dilemma Parameter space in one-dimensional cellular automata

the prisoner's dilemma (pd) is one of the most popular games of the game theory due to the emergence of cooperation among competitive rational players. in this paper, we present the pd played in cells of one-dimension cellular automata, where the number of possible neighbors that each cell interacts, z, can vary. this makes possible to retrieve results obtained previously in regular lattices. exhaustive exploration of the parameters space is presented. we show that the final state of the system is governed mainly by the number of neighbors z and there is a drastic difference if it is even or odd.