Genetic Algorithms

Abstract

The methods in this chapter were developed in response to the need for general purpose methods for solving complex optimisation problems. A classical problem addressed is the Travelling Salesman Problem in which a salesman must visit each of n cities once and only once in an optimum order - that which minimises his travelling. While not typical of a problem encountered in a computer game context, the problem of optimising responses or strategies clearly is applicable.