A Puzzle to Challenge Genetic Programming

This report represents an initial investigation into the use of genetic programming to solve the N-prisoners puzzle. The puzzle has generated a certain level of interest among the mathematical community. We believe that this puzzle presents a significant challenge to the field of evolutionary computation and to genetic programming in particular. The overall aim is to generate a solution that encodes complex decision making. Our initial results demonstrate that genetic programming can evolve good solutions. We compare these results to engineered solutions and discuss some of the implications. One of the consequences of this study is that it has highlighted a number of research issues and directions and challenges for the evolutionary computation community. We conclude the article by presenting some of these directions which range over several areas of evolutionary computation, including multi-objective fitness, coevolution and cooperation, and problem representations.

[1]  Erik D. Goodman,et al.  The royal tree problem, a benchmark for single and multiple population genetic programming , 1996 .

[2]  J. K. Kinnear,et al.  Advances in Genetic Programming , 1994 .

[3]  Sean Luke,et al.  Genetic Programming Produced Competitive Soccer Softbot Teams for RoboCup97 , 1998 .

[4]  John R. Koza,et al.  Using Programmatic Motifs and Genetic Programming to Classify Protein Sequences as to Cellular Location , 1998, Evolutionary Programming.

[5]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[6]  T. Soule,et al.  Using genetic programming to approximate maximum clique , 1996 .

[7]  Steven M. Gustafson,et al.  Layered Learning in Genetic Programming for a Cooperative Robot Soccer Problem , 2001, EuroGP.

[8]  Jason M. Daida,et al.  What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming , 1999, Genetic Programming and Evolvable Machines.

[9]  Sean Luke,et al.  Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Bloat , 2000 .

[10]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[11]  Todd Ebert,et al.  Applications of recursive operators to randomness and complexity , 1998 .

[12]  Astro Teller,et al.  Evolving Team Darwin United , 1998, RoboCup.

[13]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[14]  Heribert Vollmer,et al.  On the Autoreducibility of Random Sequences , 2000, MFCS.

[15]  Heribert Vollmer,et al.  On the Autoreducibility of Random Sequences , 2000, SIAM J. Comput..