Using the genetic algorithm to generate LISP source code to solve the prisoner's dilemma
Cory Fujiko, John Dickinson · international conference on Genetic algorithms · 1987
The genetic algorithm is adapted to manipulate Lisp S-expressions. The traditional genetic operators of crossover, inversion, and mutation are modified for the Lisp domain. The process is tested using the Prisoner's Dilemma. The genetic algorithm produces solutions to the Prisoner's Dilemma as Lisp S-expressions and these results are compared to other published solutions.