The target image is a 2x2 checkerboard. The algorithm is a steady-state GP with a population of 100. Each time a new best individual is found, it is rendered to a file. After about 6000 evaluations, the best tree had a depth of 29 and a size of 729 nodes.
Looking through the best found images is quite interesting. It gives a very visual representation of how the solution evolved: