Each integer is randomly chosen from the setof valid choices available at the current production rule.Figure 6 An overview of Section 5, the local search process.Table.ġ7. We cansee that it can be separated into 8-bit sections, which arereferred to as codons. Section of code which can becompiled.Figure 5 shows an example bit string genotype. For even-5-parity, all runsof grammatical evolution and local search produce thecorrect code, but local.
Localsearch generate the correct code, while grammaticalevolution succeeds in 195 runs.
