alpha-beta technique

For hierarchies or networks, heuristic search methods {alpha-beta technique} {minimax algorithm} repeatedly evaluate nearby situations to check if they are nearer goal situation.

scoring

Alpha-beta technique assigns scores to all evaluated situations {node, hierarchy}. Score determines which nodes to check further.

node

Nodes have immediate-successor nodes. Alpha-beta technique checks beyond current nodes minimum distance and maximum distance {depth, search}. Node scores decide which immediate successors to check further. Alpha-beta technique removes low-scoring nodes {pruning} {alpha-beta pruning} or progressively worse nodes {tapered pruning}.

depth

Alpha-beta is depth first search, rather than width first. Alpha is maximum lower bound and can only increase. Beta is minimum upper bound and can only decrease.

Whole Section in One File

3-Computer Science-Software-Algorithm-Kinds-Search

Drawings

Technical Information

Date Modified: 2022.0224