This article is cited in 3 papers

Computer science

On the solution of chess positions using computational tree logic

R. V. Khelemendik

Keldysh Institute of Applied Mathematics RAS, Moscow, Department of Theoretical Mathematics

Abstract: 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.

Key words: computational tree logic, satisfiability, model.

UDC: 519.6

DOI: 10.18500/1816-9791-2011-11-1-111-121