Compact version of Cartesian Genetic Programming

Abstract

This paper deals with the design of the compact version of Cartesian Genetic Programming. The focus is given to the search algorithm of type (1+1). The paper presents the approach that detects changes in the phenotype and, based on that, the algorithm can omit the evaluation of a candidate solution. The author uses the evolutionary design of multipliers as benchmark to present the efficiency of the algorithm.