Definitions from Wiktionary (alpha-beta pruning)
▸ noun: (computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered.
▸ Words similar to alpha-beta pruning
▸ Usage examples for alpha-beta pruning
▸ Idioms related to alpha-beta pruning
▸ Wikipedia articles (New!)
▸ Words that often appear near alpha-beta pruning
▸ Rhymes of alpha-beta pruning
▸ Invented words related to alpha-beta pruning
▸ noun: (computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered.
Similar:
alpha-beta filter,
AVL tree,
AA tree,
branch-decomposition,
iterative deepening search,
trinarization,
binary search,
branchwidth,
regression tree,
tree,
more...
▸ Words similar to alpha-beta pruning
▸ Usage examples for alpha-beta pruning
▸ Idioms related to alpha-beta pruning
▸ Wikipedia articles (New!)
▸ Words that often appear near alpha-beta pruning
▸ Rhymes of alpha-beta pruning
▸ Invented words related to alpha-beta pruning