For example, in computer chess, rather than computing the full minimax tree of all possible moves for the remainder of the game, a more limited tree of minimax possibilities is computed, with the tree being pruned at a certain number of moves, and the remainder of the tree being approximated by a static evaluation function.
Na primer, u kompjuterskom šahu, umesto obračuna minimax drveta od svih mogućih poteza za ostatak igre, ograničeno drvo sa minimax mogućnostima je uračunato, uz drvo koje je orezano u određenom broju poteza, a ostatak drveta se aproksimirastatic evaluation function.