This work shows the latest developments on chess frauds, their connections with security in computer science and how they can be fought. With the current organization of chess tournament, it is almost impossible to prevent third parties to interfere in a game or to guarantee the competition fairness. The primary concerns of a chess arbiter are to forbid players from receiving external advices, and coalition of players from biasing the outcome of the tournament. We are facing the same problem as those encountered when moving from human to human authentication to remote authentication of humans or machines. In this work, we demonstrate that chess frauds are easy to mount due to covert or subliminal channels. We describe chess frauds and link them to their analogues in the computer world. Based on these transpositions, we advocate for two radical transformations to ensure the fairness of chess tournaments.