Grammatical Evolution: Solving Trigonometric Identities

We describe a Genetic Algorithm that can evolve complete programs using a variable length linear genome to govern the mapping of a Backus Naur Form grammar deenition to a program. Expressions and programs of arbitrary complexity may be evolved. Our system, Grammatical Evolution, has already been applied to a symbolic regression problem. Here we apply our system to nd Trigonometric Identities for Cos 2x.