Evolutionary Computation and Artificial Life (202-1-5171), Semester A, 2003-2004

Exercise 5

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

Submit:
1) Java program.
2) Plot of fitness versus time of three runs for three different-sized CAs: 100, 200, 300. Fitness = average fitness of all cells.
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 at www.cs.bgu.ac.il/~barnav/teaching/ecal04a/ to create your diagrams.