Question

An optimization for this algorithm involves guessing the expected result within a set of bounds called an “aspiration window”. This algorithm produces PV-nodes, Cut-nodes, (15[1])and All-nodes, which were originally named type 1, 2, and 3 by Donald Knuth. Assuming optimal visit order, this algorithm has time complexity b to the n over 2 instead of the worst-case b to the n, since you can skip (15[1])every other layer by making the right choice first. This algorithm calls itself recursively while keeping track of upper and lower bounds, with each call toggling between a (*) “maximizing” and a “minimizing” player. (10[1])This algorithm improves on minimax by cutting off a branch of the search tree when it is discovered to be suboptimal. (10[1])For 10 points, give this search algorithm commonly used in AIs for games like checkers or chess, named after two Greek letters. ■END■ (10[1])

Back to tossups