Originally posted by greenpawn34
Ken Regan - Fide's man to catch cheats using computer match up.
http://rjlipton.wordpress.com/2013/09/17/littlewoods-law/
Can anyone put in laymans terms what on earth he is going on about.
The marbles scenario confused me (mind you easily done) even more.
The marble bit was an analogy to the players being out in the open, not hidden, and therefore supposedly easier to detect cheating, but there is one hitch in his scheme: There are many engines out there today, Hiarc, Fritz, Houdini, Chessmaster, etc., and each one gives a bit different set of moves. So in order to account for those you either have to have those engines loaded directly in a computer or have a simulator that simulates the exact set of moves each one would make.
So in order for that to be effective, you would have to have computers capable of making multiple assessments of positions for at least a dozen players in a round robin or hundreds or more in an open.
This might be able to be done but it seems to me it would require a super computer of the highest order, such as the ones currently at the top of the world list of computing speed, like the Chinese Tianhe-2 which puts out 33 petaflops per second.
So that computer could probably do the job but at this stage in technology you are talking about 100 million clams.
If they get that down to 1000 bucks it might be something FIDE or USCF or tournie directors can think about using but till then...
Look at how long the mods used to spend finding the cheats here, till they gave up.