 The evaluation putatively represents or approximates the value of the subtree below the evaluated node as if it had been searched to termination, i.e.the end of the game.During the search, an evaluation is compared against evaluations of other leaves, eliminating nodes that represent bad or poor moves for either side, to yield a node which by convergence, represents the value of the position with best play by both sides.