Janičić, Predrag and Marić, Filip and Maliković, Marko - Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture

lmcs:4233 - Logical Methods in Computer Science, March 29, 2019, Volume 15, Issue 1
Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture

Authors: Janičić, Predrag and Marić, Filip and Maliković, Marko

There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy for the chess KRK endgame. The final, machine verifiable, result presented in this paper is that there is a winning strategy for white in the KRK endgame generalized to $n \times n$ board (for natural $n$ greater than $3$). We demonstrate that different approaches for computer-based theorem proving work best together and in synergy and that the technology currently available is powerful enough for providing significant help to humans deriving complex proofs.


Source : oai:arXiv.org:1801.07528
DOI : 10.23638/LMCS-15(1:34)2019
Volume: Volume 15, Issue 1
Published on: March 29, 2019
Submitted on: January 24, 2018
Keywords: Computer Science - Logic in Computer Science,03B35, 68T15


Share