Courses/CS 461/Winter 2006/Justin Padilla/Week 5
From CSWiki
< Courses | CS 461 | Winter 2006 | Justin Padilla
[edit] The Prisoners' Dilemma
I implemented an evolutionary model based on the prisoners' dilemma in Netlogo, which can be found here.
- Each patch has a score, and each round will choose to cooperate with its neighbors or to defect.
- Scoring for the patch (this patch first) is, CC = 1, CD = 5, DC = 0, DD = 3
- It adds this score up according to itself in relation to each neighbor (Score can be from 0-40)
- The lower the score, the better.
- Each patch uses its strategy in relation to the majority of its neighbors; if most of the neighbors cooperated, it uses the regular prisoners' dilemma strategy for if it's partner cooperated and the other way around for defectiion.
- The colors represent what the patch did in the last two rounds.
