Courses/CS 461/Winter 2006/Firouz Bharthania/week5

From CSWiki

Here it is the evolutionary spatialized iterated version of the Prisoners Dilemma game. Prisoners Dilemma
Each cell chooses one of the selected strategies randomly. Then in each iteration each cell plays against it's neighbors. At next step each cell calculates the total score it got from playing against it's neighbors. Comparing all the neighbor's scores including it's own, it adopts the strategy of the cell which has the highest score.
The strategy of a cell is indicated by it's color.
Noise can be added to each of the strategies independently. Also a global noise can be applied to the whole system.
Any strategy can be omitted from the game by switching it off.
The information tab in the model contains the description for each strategy.