Jump to content

Santa Fe Trail problem

From Wikipedia, the free encyclopedia

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]

SantaFeTrail

See also

[edit]

References

[edit]
  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. ^ The Artificial Ant Problem
  3. ^ NetLogo
  4. ^ Romero's Pilgrimage to Santa Fe: A Tale of Robot Evolution
[edit]