created with NetLogo

view/download model file: MostDifferent.nlogo

WHAT IS IT?
-----------
This NetLogo simulation is aimed at stimulating some thought about
evolutionary processes.

The basic idea is this: there are a bunch of agents, each with a
"genome" (a string of bits). At each time step, each agent looks at its
(nearby) neighbors, and selects one to mate with. The selection
algorithm is to choose the neighbor who is most different (hamming
distance of genomes) from you. Reproduction is replacement of self by
a single offspring, whose genome is the result of a crossover with
the mate (a crossover point is selected; the new genome results from
one parent up to the crossover point, and the other parent from there
on -- which parent selected at random). There is also the possibility
of mutation of a "gene" (a bit in the genome).



HOW TO USE IT
-------------
Each pass through the GO function represents one time step.

The histogram shows the number of agents having a given range of genomes.