 By this alternating process, one particular terminal node whose evaluation
represents the searched value of the position will be arrived at.Its value is backed up to the root, and that evaluation becomes the valuation of the position on the board.This search process is called 'minimax'.