Ryan, ConorConorRyanNicolau, MiguelMiguelNicolauO'Neill, MichaelMichaelO'Neill2016-12-022016-12-022002 Sprin2002-04-059783540433781http://hdl.handle.net/10197/8189Genetic Programming: 5th European Conference (EuroGP), Kinsale, Co. Cork, Ireland, 3-5 April 2002This paper describes the GAUGE system, Genetic Algorithms Using Grammatical Evolution. GAUGE is a position independent Genetic Algorithm that uses Grammatical Evolution with an attribute grammar to dictate what position a gene codes for. GAUGE suffers from neither under-specification nor over-specification, is guaranteed to produce syntactically correct individuals, and does not require any repair after the application of genetic operators. GAUGE is applied to the standard onemax problem, with results showing that its genotype to phenotype mapping and position independence nature do not affect its performance as a normal genetic algorithm. A new problem is also presented, a deceptive version of the Mastermind game, and we show that GAUGE possesses the position independence characteristics it claims, and outperforms several genetic algorithms, including the competent genetic algorithm messyGA.enGrammatical evolutionGenetic algorithmsOnemax problemMastermindConference Publication10.1007/3-540-45984-7_272016-11-15https://creativecommons.org/licenses/by-nc-nd/3.0/ie/