The question that Regan's algorithm is this: "Did you cheat?"
If the algorithm comes back with "Yes," then you cheated. But it cannot come back with "No." It can only come back with "I failed to prove that you were cheating."
You need another hypothesis: "Did you not cheat?" But this is an impossible test.
A delicious conundrum.
I am completely certain, because I saw the evidence myself.
But to anyone else? There's no hard evidence - just he-said-she-said. Maybe I was mistaken - or trying to get my rival into trouble.
Knowing how it would look, maybe I keep my mouth shut rather than throwing around wild, baseless allegations about cheating.
(down to #8 now, I suppose)
In this case, his off-the-board behavior, where he seems unable to explain some of the moves he made, is also suspicious. His skill set is such that there's no move he's not capable of playing, though he should at least be able to tell you what he was thinking when he played it.
And if you’re cheating, adding another layer of “try to find moves that aren’t suspicious” would be theoretically possible.
All we know now is that an "obvious" method of cheating wasn't used. That may be because there was no cheating at all, or a new method of cheating has been developed.
> I would take Regan’s analysis with the large grain of salt, and the reason why is not because I have any insight into his algorithm or his methods, but because I know of a case of, a very high profile case, where with absolute certainty I can say that someone was cheating in an important event. And the person was investigated and was also exonerated based on Regan’s analysis. And I am certain that there was cheating. There is no doubt in my mind that this person was cheating and they got away with it.
https://www.chessdom.com/fabiano-caruana-i-would-take-regans...