It's effectiveness relies upon the existence of a static evaluator, which is a heuristic function that evaluates a board configuration. The precise definition of static evaluators of course depends on the game being played. Moreover, the definition of effective evaluators for particular games such as chess is an art. There are many variables that must be considered when evaluating the strengths or weaknesses of a chess board, and finding suitable heuristics of all these aspects of the game is difficult to do.
GAs are particularly adept at searching multi-dimensional search spaces.
A GA can be applied to the problem of deriving an effective game static evaluator. The different game characteristics to be considered by a static evaluation function are denotable as different dimensions in a search space. This project involves implementing a genetic algorithm to find a static evaluation function for a particular game of choice. Two general approaches are possible. A fixed parameter set can be predefined for the game, in which case a conventional GA using fixed-size chromosomes can be used.