Innovative Application of Genetic Algorithms in the Computer Games

The traditional methods to solve the computer games problem are to use various search algorithms on the game search tree and to combine the situation evaluation to generate the corresponding methods. The paper introduces the innovative genetic algorithms to the computer games based on the traditional methods. Through the operations for the search tree such as selection, crossover and mutation, the better search tree can be gotten from the better solutions. At the same time, the application of the evaluation functions can produce the best steps in the current situation. The advanced and modified genetic algorithms are proved to be practical and applicative by experimentations and tests of computer games.