This paper elaborates upon an idea and a development introduced and presented by Bersini in [1]. Roughly, by observing the search space of a combinatorial problem in a “clever” way, it can be drastically reduced. In order to discover this “clever way”, a second search process has to be engaged in the space of the observables. So two Genetic Algorithms (GAs) are intertwined to solve the whole problem: one in the original space and one in the space of observables of the original one. We are going to present and evaluate this idea on a Cellular Automata (CA) implementation of a binary numbers adder. The experiments show that the new algorithm, combining the two evolutionary searches, speeds up the research and/or increases the quality of the solutions in a significant way.