How to pronounce “alpha-beta pruning”

Meaning

• [Noun]
• (computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered.

Practice Nearby Words

alpha-beta filter, avl tree, aa tree, branch-decomposition, iterative deepening search, trinarization, binary search, branchwidth, regression tree, tree, breadth-first search, beta reduction, reingold-tilford algorithm, binarization, prefix tree, red-black tree, radix tree, kruskal's algorithm, abelian algebra, boron tree, branch cut, primitive recursion, minimin, binary tree, tarski-kuratowski algorithm, tabu search, back substitution, deregression, abscissio infiniti, borůvka's algorithm, british museum algorithm, subminimization, order statistic tree, b+ tree, stern-brocot tree, α-cut, superiorization, fault tree, uptree, approximation algorithm, supertree, sparsing, alpha error, bellman-ford algorithm, application, warnock's algorithm, tree kernel, subtree, brunnian braid, base case, partial function application, aak-theory, subassociation, shunting-yard algorithm, primitive polynomial, de bruijn index, minorization, recursive descent, rewriting, bitruncation, god's algorithm, algebraic graph theory, backward induction, subcycling, cherry, antipercolation, johnson's algorithm, full binary tree, algorithm x, bradford’s law, subiteration, abac, rootfinder, hillclimbing, kruskal's tree theorem, axiomatisation, suffix tree, plane tree, abbreviation, baxterization, root, backcalculation, liang–barsky algorithm, rooted tree, albert algebra, minimal polynomial, alpha conversion, warnock algorithm, computation tree logic, karp reduction, subalternate, baeza-yates-gonnet algorithm, polyalgorithm, binary indexed tree, steiner tree, bisection method, arboricity, branching process, reduction to the absurd, ackermann function

Similar Sounds

alphabetic writing, alphabetical, alphabetic, alpha beta, alan turing, unbuttoning, sabbatarian, solitariness, solitary man, solitarily