Spatial Iterated Prisoner's Dilemma

Four strategies compete on a 2D grid. Each cell plays its 8 neighbors, accumulates payoffs, then adopts the strategy of its highest-scoring neighbor (or keeps its own). Cooperation can survive and even dominate when spatial structure prevents defectors from exploiting too widely.

AllC (always cooperate)
AllD (always defect)
TFT (tit-for-tat)
Pavlov (win-stay, lose-shift)
Generation: 0  |  AllC: %  AllD: %  TFT: %  Pvl: %