On the solution of chess positions using computational tree logic

The paper describes a construction of four formulas of Computational tree logic corresponding to an arbitrary chess position. At least one of these formulas is satisfiable and leads to the solution of chess position: value of position (a draw or a victory of one of the sides) and necessary strategy for getting this value is constructed using the formula model.