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