best move
greatest change of location
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 greatest change of location is always considered first.