Detecting Cheating in Chess episode artwork

EPISODE · May 22, 2015 · 44 MIN

Detecting Cheating in Chess

from Data Skeptic

With the advent of algorithms capable of beating highly ranked chess players, the temptation to cheat has emmerged as a potential threat to the integrity of this ancient and complex game. Yet, there are aspects of computer play that are measurably different than human play. Dr. Kenneth Regan has developed a methodology for looking at a long series of modes and measuring the likelihood that the moves may have been selected by an algorithm. The full transcript of this episode is well annotated and has a wealth of excellent links to the things discussed. If you're interested in learning more about Dr. Regan, his homepage (Kenneth Regan), his page on wikispaces, and the amazon page of books by Kenneth W. Regan are all great resources.

Episode metadata supplied by the publisher feed · Published May 22, 2015

Embed this episode

Ready to play

Detecting Cheating in Chess

0:00 44:35

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 44 minutes long.

When was this Data Skeptic episode published?

This episode was published on May 22, 2015.

Can I download this Data Skeptic episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!