4 ms·
Regan's algorithm cannot prove that you did not cheat; it can only fail to prove that you cheated. The question that Regan's algorithm is this: "Did you cheat?
by EarthIsHome 4y ago
Regan's algorithm cannot prove that you did not cheat; it can only fail to prove that you cheated.
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.
- jtchang 4y agoLike a bloom filter!
- cosentiyes 4y agoAgreed, this is also likely a high precision, low recall approach to avoid false positives ruining a player's career
- gsinclair 4y agoHowever, allowing cheaters to get away with it could eventually ruin chess — that is, ruin all players’ careers. A delicious conundrum.
- deleted 4y ago[deleted]