Pregled bibliografske jedinice broj: 1017603
Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture
Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture // Logical Methods in Computer Science, 15 (2019), 1; 34, 37 doi:10.23638/LMCS-15(1:34)2019 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1017603 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Computer-Assisted Proving of Combinatorial
Conjectures Over Finite Domains: A Case Study of
a Chess Conjecture
Autori
Janičić, Predrag ; Marić, Filip ; Maliković, Marko
Izvornik
Logical Methods in Computer Science (1860-5974) 15
(2019), 1;
34, 37
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Computer-Assisted Proving ; Combinatorial Conjectures ; Finite Domains ; Chess ; KRK
Sažetak
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 x 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 some complex proofs.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo, Informacijske i komunikacijske znanosti
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
