|
Related articles:
Minimax
Search algorithm
Depth-first search
Branch and bound
Key terms: move search depth node algorithm best player minimax beta value optimal need window pruning ply result positions alpha evaluated near branch subtrees score chess heuristic simple return factor becomes earlier sorting examined mccarthy infinity game tree advantage variation first player iterative deepening move ordering search depth minimax algorithm Search external links cited by footnotes on Wikipedia page Alpha-beta pruning: |
|