Adversarial search by evolutionary computation.

Abstract excerpt

In this paper, we consider the problem of finding good next moves in two-player games. Traditional search algorithms, such as minimax and alpha-beta pruning, suffer great temporal and spatial expansion when exploring deeply into search trees to find better next moves. The evolution of genetic algorithms with the ability to find global or near global optima in limited time seems promising, but they are inept at...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Artificial Intelligence
• Share to Biological Evolution