This tool version is unpublished and cannot be run. If you would like to have this version staged, you can put a request through HUB Support.
We present a simple genetic algorithm based on cut-paste-mutation operations to solve problems with complexity scales as 2^N, where N is the size of the system. Entertaining examples of evolving to nice 2D pictures are chosen for illustration, where the complexity increases exponentially with the number of pixels. Interesting academic questions, like how the population size, number of parents for each generation, mutation rate, and probability the fitness criteria will affect the efficiency of evolution, can be studied.
Cite this work
Researchers should cite this work as follows: