Computer chess: Difference between revisions

Revision as of 18:30, 9 August 2025

Revision as of 16:43, 27 August 2025

Line 409:

[https://www.europechess.org/european-online-chess-championship-2020-regulations/ During the 2020 European Online Chess Championship], which saw a record participation of nearly 4000 players over 80 participants were disqualified for cheating—most from beginner and youth categories.<ref name="MumbaiMirrorCheating">Cheating and fair play. [https://mumbaimirror.indiatimes.com/sport/others/european-online-chess-championship-over-80-players-disqualified-for-violating-fair-play-rules/articleshow/75910673.cms European online chess championship: Over 80 players disqualified for violating fair play rules]. MumbaiMirror.indiatimes.com. May 29, 2020. Accessed 2025 Feb 11.</ref> The event underscored the growing need for advanced detection methods in online competitions.

In response to these issues, chess platforms such as [[Chess.com]] developed AI-based statistical models which track improbable moves by a player and compare them to moves that could be made by an engine. Expert examination is conducted for all suspected cases, and the findings are published on a regular basis. FIDE introduced AI behavior-tracking technology to strengthen [[anti-cheating|anti-cheating measures]] in online events.<ref name="Research">{{cite journal | last1 = Duca Iliescu | first1 = DM. [| year = 2020 | title = The Impact of Artificial Intelligence on the Chess World | url = https://pmc.ncbi.nlm.nih.gov/articles/PMC7759436/#ref3 The| Impactjournal of= ArtificialJMIR IntelligenceSerious onGames the| Chessvolume World.]= JMIR8 Serious| Games.issue 2020= Dec 10;8(4):| page = e24049. | doi: = 10.2196/24049. PMID| pmid = 33300493; PMCID:| PMC7759436.pmc = 7759436 }}</ref>

==== Challenges in cheat detection ====

Line 490:

|last=Huberman (Liskov)|first=Barbara Jane|title=A program to play chess end games|year=1968|publisher=Stanford University Department of Computer Science, Technical Report CS 106, Stanford Artificial Intelligence Project Memo AI-65|author-link=Barbara Liskov}}

* Lasar, Matthew (2011). [https://arstechnica.com/gaming/news/2011/08/force-versus-heuristics-the-contentious-rise-of-computer-chess.ars Brute force or intelligence? The slow rise of computer chess]". ''[[Ars Technica]]''.

* {{cite journal | last1 = Newborn, | first1 = Monty (| year = 1996). ''| title = Outsearching Kasparov'', | url = | journal = American Mathematical Society's Proceeding of Symposia in Applied Mathematics: Mathematical Aspects of Artificial Intelligence, v.| volume = 55, pp| issue = | pages = 175–205, 1998}}. Based on paper presented at the 1996 Winter Meeting of the AMS, Orlando, Florida, Jan 9–11, 1996.

* {{cite journal | last1 = Newborn, | first1 = Monty (| year = 2000). ''| title = Deep Blue's contribution to AI'', | url = | journal = Annals of Mathematics and Artificial Intelligence, v.| volume = 28, pp.&nbsp;| issue = | pages = 27–30, 2000.}}

* Newborn, Monty (2006). [http://www.cs.mcgill.ca/~newborn/TheoOctopusAtCasc06.pdf ''Theo and Octopus at the 2006 World Championship for Automated Reasoning Programs''], Seattle, Washington, August 18, 2006

*{{Citation|last=Stiller|first=Lewis|title=Multilinear Algebra and Chess Endgames|publisher=[[Mathematical Sciences Research Institute]], Games of No Chance, MSRI Publications, Volume 29|year=1996|___location=Berkeley, California|url=http://www.msri.org/publications/books/Book29/files/stiller.pdf|access-date=21 June 2009}}