Santa Fe Trail problem explained

The Santa Fe Trail problem is a genetic programming exercise in which artificial ants search for food pellets according to a programmed set of instructions.^{[1] [2]} The layout of food pellets in the Santa Fe Trail problem has become a standard for comparing different genetic programming algorithms and solutions.

One method for programming and testing algorithms on the Santa Fe Trail problem is by using the NetLogo application.^[3] There is at least one case of a student creating a Lego robotic ant to solve the problem.^[4]

See also

• Genetic programming
• Agent-based model
• Java Grammatical Evolution

External links

• Genetic-programming.org
• Grammatical-evolution.org
• Teamwork in genetic programming
• java Grammatical Evolution

Notes and References

1. Koza, John R., Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA. 1992. pp. 147-155. Print.
2. http://www.cs.ucl.ac.uk/staff/ucacbbl/bloat_csrp-97-29/node2.html#SECTION00020000000000000000 The Artificial Ant Problem
3. http://ccl.northwestern.edu/netlogo/ NetLogo
4. http://lslwww.epfl.ch/pages/research/papers/romero/ Romero's Pilgrimage to Santa Fe: A Tale of Robot Evolution