[ChrisLomont]

>this really weird brute force statistical analysis

Care to explain why you call the method "really weird"? Is there a flaw in the statistics that you can correct?

Here's [1] his publications - all well cited, his h-index is good, and I find no refutation of complaints in the literature about his methods. He seems quite competent in this area.

>how you can state there's no reason whatsoever to suspect him of cheating is absurd

If cheating does not show up in performance then is it cheating? If there is any performance gain then it should show up at some statistical level.

[1] https://scholar.google.com/citations?user=8nk9k5oAAAAJ&hl=en...

[SilverBirch]

It's not that the statistics are wrong, it's that you can't apply statistics to prove this at all. Specifically because the person you're analyzing knows all about chess. They know that a super strong weird move will just expose them, so instead they're going to pick lines that just slightly increase their strength. This is like the statistical analyses that show election rigging by highlighting a statistically improbable distribution of results - that analysis works if the person rigging the election doesn't consider the statistical analysis when they're doing their cheating, it is completely avoidable if you cheat competently.

Which brings us back to a sort of basic question - if this guy is cheating, do we think he's doing it fairly competently or not? If he's not cheating, the statistics will show normal play, if he is cheating and he's fairly competent the statistics will show normal play. So what has this analysis done? It's proved that he's not totally incompetent, which we already knew because he's pretty well established as a good chess player even he isn't truly a 2700ELO.

[ChrisLomont]

>it's that you can't apply statistics to prove this at all

If there are not statistical differences, then there are no performance differences. Cheating by definition should imply performance differences.

If he is cheating, then at some point in the future, if that method becomes detectable and he has to stop, then his play will suddenly suffer, which would be more evidence.

Claiming that statistics cannot answer this question with statistics is not true. It may be hard, or the current sample too small, but claiming stats is not usable is a misunderstanding of statistics.

>This is like the statistical analyses that show election rigging by highlighting a statistically improbable distribution of results

This only works on the public, and is not what professional statisticians that analyze elections do.

And even here, if the event is rare enough, say 1 part in quadrillions, and the analysis is correct, then yes, we would certainly conclude there was rigging.

All human knowledge is statistical. Things we claim to be true are only statistically true to large odds, so even for election rigging, if the stats reach some level of certainty, then it is completely valid proof that would hold in court.

The pop idiocy of election rigging claims has never risen to that level.

>it is completely avoidable if you cheat competently

No, it is not. It may only lower the signal to noise ratio, but there is still detectable differences. If you continually improve the statistics and are forced to lower the signal, eventually the signal would be so low as to not affect the system, which in this case is chess games.

Physics, for example, can tease events out of on the order of 1 part in trillions and demonstrate signal. Plenty of other things do the same.