positions for which the result is certain, given best play, are technical positions. the best example is the analysis by computer chess engine of all possible positions with six pieces or fewer. this is called proof by exhaustion or exhaustive proof. it is logically the same as proving a mathematical theorem by proving the complete set of individual cases covered by the theorem.