Slashdot Mirror
How Do You Detect Cheating In Chess? Watch the Computer
First time accepted submitter Shaterri writes "Which is more likely: that a low-ranked player could play through a high-level tournament at grandmaster level, or that they were getting undetected assistance from a computer? How about when that player is nearly strip-searched with no devices found? How about when their moves correlate too well with independent computer calculations? Ken Regan has a fascinating article on one of the most complex (potential) cheating cases to come along in recent memory."
It seems pretty obvious upon RTFA that this guy is likely to have cheated.
One of Ivanov’s losses was in a long game in a closed position (the kind where computers perform poorly), and at the end, Ivanov made a rudimentary mistake. It stood out because of how well he had played in the other games. The other loss was in the penultimate round, when the organizers, as a precaution, stopped broadcasting the games on the Internet so that people outside the playing hall could not try to assist the players.
Please mod this post up so other people can see it -- I'm sorry I don't have an account and I'm late for work.
It is mathematically proven to be unsolveable within finite time
Every game ends in a finite number of moves, therefore the permutation of all games is also finite.
"His name was James Damore."
So it is doubtful that Garry Kasparov would lose to Chessmaster XI at its highest AI on a normal computer a.k.a. not Deep Blue.
Don't bet on it. Deep Blue was designed in 1996. That was 17 years ago. A modern laptop has more computing power than Deep Blue had. Chess algorithms have also improved. You can download free chess programs from any app store that will play at grandmaster level.
Playing chess against a computer is like having a weight lifting contest with a forklift.