Leaf nodes show heuristic values.

Two values, alpha for MAX and beta for MIN are determined during each search using more informed heuristics for efficiency.

Alpha can never decrease and Beta can never increase.

Use two rules below to terminate search based on alpha and beta values:

Stop the search below any MIN node if the alpha value of its ancestors $($MAX node$)$ the beta value of the MIN node.

Stop the search below any MAX node if the beta value of any of its ancestors $($MIN node$)$ the alpha value of the MAX node.

$41$