= Minimax search
{title2=$V(s)=\max_{s'}V(s')\ \text{or}\ \min_{s'}V(s')$}
<Backward induction> on a finite deterministic <game tree> of a two-player <zero-sum game>. Terminal <payoffs> are propagated by maximization at one player's decision nodes and minimization at the other's. With full information, the resulting choices give an optimal strategy against the opposing player's best response. A cyclic state <graph> requires a winning condition on infinite plays and a <graph> algorithm rather than unrestricted recursive unfolding.
Back to article page
