best move
optimal action
In alpha–beta pruning, the search is fastest (in fact, optimal) when the child of a node corresponding to the best move is always considered first.
In alpha–beta pruning, the search is fastest (in fact, optimal) when the child of a node corresponding to the optimal action is always considered first.