Here’s an insane thought that would virtually abolish all sandbagging ever. I’m not arguing for this thought’s popularity, just that it should exist in the dark corner of people’s minds if cheating ever grows out of hand (doubtful).
In a nugget: don’t used advertised rating classes for the purposes of prizes. Everyone should show up because they like chess, not because their xx99 rating guarantees them a great shot at a prize.
A basic computer program could be implemented after the end of the first round witnessed by all participants who care. This program, as an example, would average the ratings of the top let’s say, 10% of all participants. Then a random factor of ±, let’s say 50 points, could be added to that number (for total fairness sake) and then “classes” are determined by blocking people off by a predetermined interval chosen by the organizer (I’m assuming the USCF class default of 200 rating points would be the most likely choice).
So if the top 10% at a small tournament are rated 2150, 2100, 2000, and 1950, the average would be 2050. Then, if you wanted this option, add ±50 to make totally random. Let’s pretend we just kept the 2050 for this exercise. Then classes would emerge at 1850-2049, 1650-1849, 1450-1649, 1250-1449, etc.
If a player ends up being the only one in his class, it could be pointed out that it could have easily happened had we used the traditional USCF rating class boundaries as well; he just had some odd luck.
Obviously, this idea would be unpopular because people don’t like randomness. However, the mathematical conception of the idea has a lot of merit. The details can certainly be improved upon by someone more intelligent than myself. Selling its fairness though would be hard.
If you have any critiques please ask yourself beforehand if they don’t also apply to the current system. In any case, I hope you enjoyed the little contribution. Ben Bentrup