Cartesian genetic programming

From Wikipedia Quality
Jump to: navigation, search

Cartesian genetic programming is a form of genetic programming, which uses a graph representation to encode computer programs. It grew from a method of evolving digital circuits developed by Miller et al. in 1997. However the term ‘Cartesian genetic programming’ first appeared in 1999 and was proposed as a general form of genetic programming in 2000. It is called ‘Cartesian’ because it represents a program using a two-dimensional grid of nodes.