Dr. Kenneth Regan is a professor of computer science at the University of Buffalo. He is perhaps best known for his work to prove and disprove allegations of cheating in chess.
In this episode Ken talks about his discovery that he had a unique background to approach this problem, his model for evaluating chess matches, and the important issues that are weighed in any suspected cheating case.
Ken's website: https://cse.buffalo.edu/~regan/
Email the show - risk of ruin pod at gmail
Follow us on twitter:
https://x.com/halfkelly
00:00 Before we start
00:27 A moment of scientific joy
02:54 An embarrassing admission
04:20 No basis to establish cheating
05:54 Inference from imperfect information
07:10 A form of language
08:40 From 1400 to nearly master
09:33 Dots and lines
10:54 Too often, with Fritz 9
13:13 29 of 32
14:46 Loaded for bear
17:53 Elo in two minutes
20:00 A thousand-sided die
22:08 Four motives
25:03 Over the board is hard
26:17 Cheating in small increments
27:54 Fourth and 15
29:47 A 2850 signal
31:47 Ceilings
33:47 Not a magic button
35:55 How sure is sure?
37:47 Four times the data
39:51 Fast moves, better moves
44:10 Look elsewhere
48:55 The frozen envelope
51:21 Kramnik accuses Nakamura
52:50 Frozen ratings
54:32 1845 on the wall chart
57:18 The dog that didn't bark
59:21 Doing science faithfully
More episodes from "Risk of Ruin"
Don't miss an episode of “Risk of Ruin” and subscribe to it in the GetPodcast app.
