Adversarial search
= Adversarial search
Exploration of a <game tree> containing choices by competing decision makers. A maximizing node chooses the largest successor value; a minimizing opponent chooses the smallest. Known random outcomes instead require chance nodes and <expected values>, as in <expectimax>. A <game tree> representation can combine controlled choices and chance without assuming that chance maliciously chooses its worst outcome.