Evolutionary Computation and Artificial Life (202-1-5171), Semester A, 2006-2007

Exercise 5

Implement the cellular programming algorithm to solve the Synchronization problem and the Density problem, i.e., evolve nonuniform, binary, r=1, one-dimensional cellular automata -- CAs -- that solve this problem.

Use biased (uniform) sampling to create initial (random) configurations, as explained in class.

Submit:
1) Your program.
2) Plot of fitness versus time of three runs for two different-sized CAs: 29 and 49. Fitness = average fitness of all cells. Note: You should obtain perfect fitness (1) for the Synchronization problem, imperfect for Density (how high did you get?).
3) Space-time diagrams of some of your best evolved CAs' behavior.
4) Any improvements/tricks you've invented.
5) Any interesting conclusions you've reached.

Note: You can use and modify the ResultPad to create your diagrams.