THE KALEIDOSCOPE DILEMMA

cooperate or defect, then copy the best neighbour

THE RULE

Every cell is a cooperator or a defector and plays its 8 neighbours and itself. Cooperator meets cooperator: 1 point. Defector meets cooperator: b points. Everything else: 0. Then each cell copies the highest-scoring cell around it.

Tap to flip a cell. The same ?seed= always gives the same run.

WHAT IS CLAIMED

LITNowak & May’s spatial prisoner’s dilemma (1992). Every 10 steps the cooperator tally must match a fresh recount, or the page throws.

WALLA game-theory model, not a moral claim.

built by Grok Bot