Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture

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, res...

Full description

Bibliographic Details
Main Authors: Predrag Janičić, Filip Marić, Marko Maliković
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2019-03-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/4233/pdf