Skip to main content
. 2005 Jun 21;272(1570):1373–1377. doi: 10.1098/rspb.2005.3072

Table 2.

The basic algorithm.

(i) create an initial population of n individuals (strategies of individuals are distributed randomly from k=−5 to 6)
(ii) g individuals are chosen randomly from the population
(iii) these g individuals play a game
(iv) procedures (ii) and (iii) are repeated m times
(v) individuals leave offspring depending on their fitness
(vi) image scores are reset to zero
(vii) repeat procedures (ii)–(vi)