A Hybrid Genetic Algorithm for an NP-Complete Problem with an Expensive Evaluation Function.
Richard RankinRalph W. WilkersonGeoff HarrisJo SpringPublished in: SAC (1993)
Keyphrases
- evaluation function
- np complete
- randomly generated
- satisfiability problem
- np hard
- temporal difference
- constraint satisfaction problems
- computational complexity
- hybrid genetic algorithm
- two player games
- computer chess
- temporal difference learning
- iterative deepening
- td learning
- alpha beta
- branching factor
- game tree search
- optimality criterion
- conjunctive queries
- heuristic search algorithms
- heuristic function
- computationally expensive
- polynomial time complexity
- dynamic programming
- minimax search
- alpha beta pruning