Assignment
1. Simple genetic algorithm
Write a program that implement genetic algorithm to solve f(x)
= x^3, x is an integer 0..255. Using initial population 20,
selection method by choosing the 4 fittest individuals, recombination 90%,
mutation 10%. The fitness function is the value of f(x). Purpose
of this assignment is to learn how genetic algorithm work. You can
find the program in Goldberg's text book.
2. Prisoner's dilemma
Repeat the experiment of Axelrod (1985) in using GA to find the strategy
that play Prisoner's dilemma. Discuss the finding, how the strategy
evolved? Do you find the similar phenomena described by Axelrod?