But think about what that means in terms of chess. In the mathematical theory of games there is a theorem telling you that any finite, two-person, zero-sum game—such as chess—has an optimal solution. That is, there is a way of choosing moves that will allow each player, black and white, to do better than he would with any other choice of moves.
