abstract = "In this paper we examine the behaviour of the uniform
crossover and point mutation GP operators [12] on the
even-n-parity problem for n = 3; 4; 6 and present a
novel representation of function nodes, designed to
allow the search operators to make smaller movements
around the solution space. Using this representation,
performance on the even-6-parity problem is improved by
three orders of magnitude relative to the estimate
given for standard GP in [5].",