Implementation of a dynamic tree searching algorithm in a chess programme.
Gerhard WolfPublished in: ACM Annual Conference (1973)
Keyphrases
- tree structure
- computational complexity
- detection algorithm
- optimal solution
- learning algorithm
- binary tree
- computational cost
- matching algorithm
- preprocessing
- np hard
- dynamic programming
- game tree
- suffix tree
- parallel implementation
- improved algorithm
- times faster
- tree construction
- particle swarm optimization
- linear programming
- high accuracy
- hardware implementation
- worst case
- experimental evaluation
- minimum spanning tree
- cost function
- k means
- search space