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.

Related Articles

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.

Reported by AI

Amateur mathematicians have stunned professionals by using AI tools like ChatGPT to tackle long-standing problems posed by Paul Erdős. While most solutions rediscover existing results, one new proof highlights AI's potential to transform mathematical research. Experts see this as an early step toward broader applications in the field.

World chess champion D Gukesh endured a shocking one-move blunder in the sixth round of the Tata Steel Chess 2026 Masters, leading to his first defeat of the year against Nodirbek Abdusattorov. The 19-year-old Indian prodigy followed it with another loss to Anish Giri in the seventh round, marking back-to-back setbacks. Despite the mishap, Gukesh bounced back by defeating Vladimir Fedoseev on Sunday.

Reported by AI

In Colombia, an online list dubbed the 'Excel of the unfaithful' circulates, exposing alleged infidelity cases, particularly during December holidays. This unverified data network poses risks of false accusations and personal vendettas. Additionally, debate arises over whether relationships with artificial intelligence count as infidelity.

 

 

 

This website uses cookies

We use cookies for analytics to improve our site. Read our privacy policy for more information.
Decline