Limited cheating in chess dramatically increases win chances

A new study reveals that using computer advice for just three moves in a chess game can boost a player's victory odds from 51 percent to 84 percent. Researcher Daniel Keren simulated thousands of matches to demonstrate how selective cheating evades detection. The findings highlight vulnerabilities in online chess platforms' anti-cheating measures.

Daniel Keren from the University of Haifa in Israel conducted a simulation of 100,000 chess matches using the Stockfish engine, pitting engines rated at 1500 Elo—equivalent to an average player—against each other. In half the games, no external help was provided, while the other half allowed interventions from a superior 3190 Elo engine on select moves.

Normally, the player with the white pieces holds a slight edge, winning about 51 percent of the time due to the first-move advantage. However, Keren's results showed that seeking computer advice on a single move raises this to 66 percent. With three such interventions, the win probability surges to 84 percent on average.

"I thought that one cheat would increase the ratio to 55 per cent and another one to maybe 60 per cent," Keren remarked. "Cheating three times and you reach 84 per cent – to me, that was astounding."

Timing proves crucial: a single intervention around the 30th move can enhance win chances by 15 percentage points, outperforming five randomly timed cheats, which yield only a 7.5-point gain. The simulation's algorithm intervened only when the suggested move substantially improved outcomes, with thresholds tightening as the game progressed, offering a form of disguise against detection.

Keren emphasizes that his research aims to inform chess platforms about cheating risks, not encourage it. "The idea is to see what cheating can do," he said. "Know thy enemy, right?"

Expert Kim Schu from the University of Mainz agrees, noting, "A single engine ‘hint’ in the right position can be game-deciding, and because humans can sometimes find the same best move, that kind of selective cheating is unusually difficult to prove from move analysis alone."

To combat this, Schu advocates combining move analysis with behavioral monitoring, move timings, and account histories for robust anti-cheating systems, especially as online play grows.

相关文章

D Gukesh confidently addressing chess cheating controversy at Prague press conference, chessboard and city skyline in background.
AI 生成的图像

D·古克什淡化普拉格国际象棋作弊争议

由 AI 报道 AI 生成的图像

国际象棋世界冠军D·古克什表示,象棋作弊问题被夸大,并不像所描绘的那样普遍。在布拉格国际象棋节前夕,他与前冠军弗拉基米尔·克拉姆尼克的无根据指控保持距离,同时重申反对不道德比赛。象棋界其他知名人士也同样批评克拉姆尼克,此事源于与国际棋联(FIDE)的持续争端。

A physicist's study of Chess960, a variant that randomizes starting piece positions, shows that not all configurations are equally fair to white and black players. By evaluating complexity using chess software, the research identifies positions that could balance the game better. This challenges the assumption that randomization alone ensures equity in the popular format.

由 AI 报道

美国特级大师卡鲁阿纳分享了对象棋作弊的看法,强调了在线平台与传统线下赛事之间的差异。在其C Squared播客中,他指出从未在自己参加的现场锦标赛中目睹作弊。卡鲁阿纳强调,在线作弊往往被悄然处理,而线下环境则面临严重后果。

A new research paper demonstrates that large language models can identify real identities behind anonymous online usernames with high accuracy. The method, costing as little as $4 per person, analyzes posts for clues and cross-references them across the internet. Researchers from ETH Zurich, Anthropic, and MATS warn of reduced online privacy.

由 AI 报道

随着世界冠军D Gukesh在2026年布拉格国际象棋节遭遇挑战(如先前报道所述),多名印度顶尖特级大师FIDE排名下滑。本分析探讨潜在原因及恢复路径。

乌兹别克斯坦的诺迪尔别克·阿卜杜萨托罗夫在荷兰的Tata Steel国际象棋赛中获胜,该赛事于2月1日结束。同胞贾沃希尔·辛达罗夫获得第二名。一个值得注意的时刻发生在阿卜杜萨托罗夫第六轮对阵世界冠军D. Gukesh的比赛中,一次失误导致Gukesh认输。

由 AI 报道

A Cornell University study reveals that AI tools like ChatGPT have increased researchers' paper output by up to 50%, particularly benefiting non-native English speakers. However, this surge in polished manuscripts is complicating peer review and funding decisions, as many lack substantial scientific value. The findings highlight a shift in global research dynamics and call for updated policies on AI use in academia.

 

 

 

此网站使用 cookie

我们使用 cookie 进行分析以改进我们的网站。阅读我们的 隐私政策 以获取更多信息。
拒绝