Interior-Node Score Bounds in a Brute-Force Chess Program.
David J. SlatePublished in: J. Int. Comput. Games Assoc. (1984)
Keyphrases
- computer chess
- brute force
- evaluation function
- search quality
- lower bound
- upper bound
- computationally expensive
- locality sensitive hashing
- machine learning
- directed graph
- exhaustive search
- heuristic search
- candidate set
- graph structure
- game tree search
- scoring function
- upper and lower bounds
- reinforcement learning
- neural network
- error bounds
- worst case
- np hard