AI-powered mechanisms as judges: Breaking ties in chess

Recently, Artificial Intelligence (AI) technology use has been rising in sports to reach decisions of various complexity. At a relatively low complexity level, for example, major tennis tournaments replaced human line judges with Hawk-Eye Live technology to reduce staff during the COVID-19 pandemic....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:PloS one 2024-11, Vol.19 (11), p.e0305905
Hauptverfasser: Anbarci, Nejat, Ismail, Mehmet S
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 11
container_start_page e0305905
container_title PloS one
container_volume 19
creator Anbarci, Nejat
Ismail, Mehmet S
description Recently, Artificial Intelligence (AI) technology use has been rising in sports to reach decisions of various complexity. At a relatively low complexity level, for example, major tennis tournaments replaced human line judges with Hawk-Eye Live technology to reduce staff during the COVID-19 pandemic. AI is now ready to move beyond such mundane tasks, however. A case in point and a perfect application ground is chess. To reduce the growing incidence of ties, many elite tournaments have resorted to fast chess tiebreakers. However, these tiebreakers significantly reduce the quality of games. To address this issue, we propose a novel AI-driven method for an objective tiebreaking mechanism. This method evaluates the quality of players' moves by comparing them to the optimal moves suggested by powerful chess engines. If there is a tie, the player with the higher quality measure wins the tiebreak. This approach not only enhances the fairness and integrity of the competition but also maintains the game's high standards. To show the effectiveness of our method, we apply it to a dataset comprising approximately 25,000 grandmaster moves from World Chess Championship matches spanning from 1910 to 2018, using Stockfish 16, a leading chess AI, for analysis.
doi_str_mv 10.1371/journal.pone.0305905
format Article
fullrecord <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_3123292896</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A814466250</galeid><sourcerecordid>A814466250</sourcerecordid><originalsourceid>FETCH-LOGICAL-c506t-1675bc61217d60759dfa056663d10bcb86b955229b2c280ce5b240b6670843463</originalsourceid><addsrcrecordid>eNqNkl2L1DAUhoso7rr6D0QLguhFx3w0aeONjMuqAwsLft2GND1tM7bJ2NP68e-3w3SXqeyF5CIhed73JCdvFD2lZEV5Rt9sw9h70652wcOKcCIUEfeiU6o4SyQj_P7R-iR6hLglRPBcyofRCVdpLjLBTqNsvUl24Tf0UMYd2MZ4hx3GBuPtWNaAb-P3PZgfztfx4ABj52PbAOLj6EFlWoQn83wWfftw8fX8U3J59XFzvr5MrCBySKjMRGElZTQrJcmEKitDhJSSl5QUtshloYRgTBXMspxYEAVLSSFlRvKUp5KfRc8Pvrs2oJ7fjJpTxpliudoT72ZiLDooLfihN63e9a4z_V8djNPLE-8aXYdfmlLBCeF8cng1O_Th5wg46M6hhbY1HsJ4KMZlTpia0Bf_oHdfaaZq04J2vgpTYbs31eucpqmUTJCJWt1BTaOEztnpVys37S8ErxeCiRngz1CbEVFvvnz-f_bq-5J9ecQ2YNqhwdCOgwsel2B6AG0fEHuobrtMid6H8qYbeh9KPYdykj07_qFb0U0K-TWVYtjl</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3123292896</pqid></control><display><type>article</type><title>AI-powered mechanisms as judges: Breaking ties in chess</title><source>MEDLINE</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Public Library of Science (PLoS)</source><source>PubMed Central</source><source>Free Full-Text Journals in Chemistry</source><creator>Anbarci, Nejat ; Ismail, Mehmet S</creator><contributor>Thomaz, Carlos Eduardo</contributor><creatorcontrib>Anbarci, Nejat ; Ismail, Mehmet S ; Thomaz, Carlos Eduardo</creatorcontrib><description>Recently, Artificial Intelligence (AI) technology use has been rising in sports to reach decisions of various complexity. At a relatively low complexity level, for example, major tennis tournaments replaced human line judges with Hawk-Eye Live technology to reduce staff during the COVID-19 pandemic. AI is now ready to move beyond such mundane tasks, however. A case in point and a perfect application ground is chess. To reduce the growing incidence of ties, many elite tournaments have resorted to fast chess tiebreakers. However, these tiebreakers significantly reduce the quality of games. To address this issue, we propose a novel AI-driven method for an objective tiebreaking mechanism. This method evaluates the quality of players' moves by comparing them to the optimal moves suggested by powerful chess engines. If there is a tie, the player with the higher quality measure wins the tiebreak. This approach not only enhances the fairness and integrity of the competition but also maintains the game's high standards. To show the effectiveness of our method, we apply it to a dataset comprising approximately 25,000 grandmaster moves from World Chess Championship matches spanning from 1910 to 2018, using Stockfish 16, a leading chess AI, for analysis.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0305905</identifier><identifier>PMID: 39485752</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Artificial Intelligence ; Biology and Life Sciences ; Carlsen, Magnus ; Chess ; Computer and Information Sciences ; COVID-19 ; COVID-19 - epidemiology ; Engineering and Technology ; Epidemics ; Forecasts and trends ; Game theory ; Humans ; Judgment ; Medicine and Health Sciences ; Pandemics ; Physical Sciences ; SARS-CoV-2 ; Social Sciences ; Sports ; Task complexity ; Technology application ; Tournaments &amp; championships</subject><ispartof>PloS one, 2024-11, Vol.19 (11), p.e0305905</ispartof><rights>Copyright: © 2024 Anbarci, Ismail. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.</rights><rights>COPYRIGHT 2024 Public Library of Science</rights><rights>2024 Anbarci, Ismail. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2024 Anbarci, Ismail 2024 Anbarci, Ismail</rights><rights>2024 Anbarci, Ismail. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c506t-1675bc61217d60759dfa056663d10bcb86b955229b2c280ce5b240b6670843463</cites><orcidid>0000-0002-3232-0776 ; 0000-0001-5952-8086</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC11530033/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC11530033/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,727,780,784,864,885,2927,23865,27923,27924,53790,53792,79471,79472</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/39485752$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Thomaz, Carlos Eduardo</contributor><creatorcontrib>Anbarci, Nejat</creatorcontrib><creatorcontrib>Ismail, Mehmet S</creatorcontrib><title>AI-powered mechanisms as judges: Breaking ties in chess</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>Recently, Artificial Intelligence (AI) technology use has been rising in sports to reach decisions of various complexity. At a relatively low complexity level, for example, major tennis tournaments replaced human line judges with Hawk-Eye Live technology to reduce staff during the COVID-19 pandemic. AI is now ready to move beyond such mundane tasks, however. A case in point and a perfect application ground is chess. To reduce the growing incidence of ties, many elite tournaments have resorted to fast chess tiebreakers. However, these tiebreakers significantly reduce the quality of games. To address this issue, we propose a novel AI-driven method for an objective tiebreaking mechanism. This method evaluates the quality of players' moves by comparing them to the optimal moves suggested by powerful chess engines. If there is a tie, the player with the higher quality measure wins the tiebreak. This approach not only enhances the fairness and integrity of the competition but also maintains the game's high standards. To show the effectiveness of our method, we apply it to a dataset comprising approximately 25,000 grandmaster moves from World Chess Championship matches spanning from 1910 to 2018, using Stockfish 16, a leading chess AI, for analysis.</description><subject>Artificial Intelligence</subject><subject>Biology and Life Sciences</subject><subject>Carlsen, Magnus</subject><subject>Chess</subject><subject>Computer and Information Sciences</subject><subject>COVID-19</subject><subject>COVID-19 - epidemiology</subject><subject>Engineering and Technology</subject><subject>Epidemics</subject><subject>Forecasts and trends</subject><subject>Game theory</subject><subject>Humans</subject><subject>Judgment</subject><subject>Medicine and Health Sciences</subject><subject>Pandemics</subject><subject>Physical Sciences</subject><subject>SARS-CoV-2</subject><subject>Social Sciences</subject><subject>Sports</subject><subject>Task complexity</subject><subject>Technology application</subject><subject>Tournaments &amp; championships</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqNkl2L1DAUhoso7rr6D0QLguhFx3w0aeONjMuqAwsLft2GND1tM7bJ2NP68e-3w3SXqeyF5CIhed73JCdvFD2lZEV5Rt9sw9h70652wcOKcCIUEfeiU6o4SyQj_P7R-iR6hLglRPBcyofRCVdpLjLBTqNsvUl24Tf0UMYd2MZ4hx3GBuPtWNaAb-P3PZgfztfx4ABj52PbAOLj6EFlWoQn83wWfftw8fX8U3J59XFzvr5MrCBySKjMRGElZTQrJcmEKitDhJSSl5QUtshloYRgTBXMspxYEAVLSSFlRvKUp5KfRc8Pvrs2oJ7fjJpTxpliudoT72ZiLDooLfihN63e9a4z_V8djNPLE-8aXYdfmlLBCeF8cng1O_Th5wg46M6hhbY1HsJ4KMZlTpia0Bf_oHdfaaZq04J2vgpTYbs31eucpqmUTJCJWt1BTaOEztnpVys37S8ErxeCiRngz1CbEVFvvnz-f_bq-5J9ecQ2YNqhwdCOgwsel2B6AG0fEHuobrtMid6H8qYbeh9KPYdykj07_qFb0U0K-TWVYtjl</recordid><startdate>20241101</startdate><enddate>20241101</enddate><creator>Anbarci, Nejat</creator><creator>Ismail, Mehmet S</creator><general>Public Library of Science</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>COVID</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><orcidid>https://orcid.org/0000-0002-3232-0776</orcidid><orcidid>https://orcid.org/0000-0001-5952-8086</orcidid></search><sort><creationdate>20241101</creationdate><title>AI-powered mechanisms as judges: Breaking ties in chess</title><author>Anbarci, Nejat ; Ismail, Mehmet S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c506t-1675bc61217d60759dfa056663d10bcb86b955229b2c280ce5b240b6670843463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Artificial Intelligence</topic><topic>Biology and Life Sciences</topic><topic>Carlsen, Magnus</topic><topic>Chess</topic><topic>Computer and Information Sciences</topic><topic>COVID-19</topic><topic>COVID-19 - epidemiology</topic><topic>Engineering and Technology</topic><topic>Epidemics</topic><topic>Forecasts and trends</topic><topic>Game theory</topic><topic>Humans</topic><topic>Judgment</topic><topic>Medicine and Health Sciences</topic><topic>Pandemics</topic><topic>Physical Sciences</topic><topic>SARS-CoV-2</topic><topic>Social Sciences</topic><topic>Sports</topic><topic>Task complexity</topic><topic>Technology application</topic><topic>Tournaments &amp; championships</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Anbarci, Nejat</creatorcontrib><creatorcontrib>Ismail, Mehmet S</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing &amp; Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological &amp; Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>Coronavirus Research Database</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing &amp; Allied Health Database (Alumni Edition)</collection><collection>Meteorological &amp; Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing &amp; Allied Health Premium</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Anbarci, Nejat</au><au>Ismail, Mehmet S</au><au>Thomaz, Carlos Eduardo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>AI-powered mechanisms as judges: Breaking ties in chess</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2024-11-01</date><risdate>2024</risdate><volume>19</volume><issue>11</issue><spage>e0305905</spage><pages>e0305905-</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>Recently, Artificial Intelligence (AI) technology use has been rising in sports to reach decisions of various complexity. At a relatively low complexity level, for example, major tennis tournaments replaced human line judges with Hawk-Eye Live technology to reduce staff during the COVID-19 pandemic. AI is now ready to move beyond such mundane tasks, however. A case in point and a perfect application ground is chess. To reduce the growing incidence of ties, many elite tournaments have resorted to fast chess tiebreakers. However, these tiebreakers significantly reduce the quality of games. To address this issue, we propose a novel AI-driven method for an objective tiebreaking mechanism. This method evaluates the quality of players' moves by comparing them to the optimal moves suggested by powerful chess engines. If there is a tie, the player with the higher quality measure wins the tiebreak. This approach not only enhances the fairness and integrity of the competition but also maintains the game's high standards. To show the effectiveness of our method, we apply it to a dataset comprising approximately 25,000 grandmaster moves from World Chess Championship matches spanning from 1910 to 2018, using Stockfish 16, a leading chess AI, for analysis.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>39485752</pmid><doi>10.1371/journal.pone.0305905</doi><tpages>e0305905</tpages><orcidid>https://orcid.org/0000-0002-3232-0776</orcidid><orcidid>https://orcid.org/0000-0001-5952-8086</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1932-6203
ispartof PloS one, 2024-11, Vol.19 (11), p.e0305905
issn 1932-6203
1932-6203
language eng
recordid cdi_plos_journals_3123292896
source MEDLINE; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Public Library of Science (PLoS); PubMed Central; Free Full-Text Journals in Chemistry
subjects Artificial Intelligence
Biology and Life Sciences
Carlsen, Magnus
Chess
Computer and Information Sciences
COVID-19
COVID-19 - epidemiology
Engineering and Technology
Epidemics
Forecasts and trends
Game theory
Humans
Judgment
Medicine and Health Sciences
Pandemics
Physical Sciences
SARS-CoV-2
Social Sciences
Sports
Task complexity
Technology application
Tournaments & championships
title AI-powered mechanisms as judges: Breaking ties in chess
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T21%3A03%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=AI-powered%20mechanisms%20as%20judges:%20Breaking%20ties%20in%20chess&rft.jtitle=PloS%20one&rft.au=Anbarci,%20Nejat&rft.date=2024-11-01&rft.volume=19&rft.issue=11&rft.spage=e0305905&rft.pages=e0305905-&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0305905&rft_dat=%3Cgale_plos_%3EA814466250%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3123292896&rft_id=info:pmid/39485752&rft_galeid=A814466250&rfr_iscdi=true