README
1+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
2
3Iterated Prisoner's Dilemma (ipd): Co-evolution GA example with Open BEAGLE
4
5Copyright (C) 2003
6by Christian Gagne <cgagne@gmail.com>
7and Marc Parizeau <parizeau@gel.ulaval.ca>
8
9+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
10
11
12Getting started
13===============
14
15 Example is compiled in binary 'ipd'. Configuration file for first
16 thread/population is in file 'ipd-thread1.conf', while configuration file
17 for second thread/population is in file 'ipd-thread2.conf'.
18
19Objective
20=========
21
22 Find solutions to the iterated prisoner's dilemma that get the highest reward for
23 its actions.
24
25Representation
26==============
27
28 Bit strings made of 3 bits. First bit is the action to take at the first turn
29 (0=defect, 1=cooperate), the second bit is the action to make knowing that
30 the companion has defected at the last turn, and the third bit is the action to
31 do knowing that the companion has cooperate the last turn.
32
33Fitness
34=======
35
36 For each turn, the individual receives points for its action. Each evaluation is done
37 on a total of 8 turns (iterations). The points given for each turn are the following:
38 - 0 points if the player cooperate and the companion defects.
39 - 1 points if the player defects and the companion defects.
40 - 3 points if the player defects and the companion cooperate.
41 - 5 points if the player cooperate and the companion cooperate.
42