Spot impossible scores before they reach the leaderboard

A leaderboard with one absurd entry stops anyone caring about it, and checking each score by hand is out of the question. This entry shows how to work out the most a run could possibly earn from the rules of the game, and how to turn that into a quick accept or reject.

Why this works

You cannot prove who is honest, but you can prove what is impossible. The rules of your own game set a hard upper limit on what a run can earn, so rejecting anything above it never blocks a fair player, however clever the cheater is below it.

When not to use it

It is the wrong tool against cheaters who stay just under the limit, or in games where one lucky chain can multiply points without bound. There, keep the full record of the run and replay it, or compare against other players.

In the full entry

• What to build, step by step
• Starting values and the reason for each
• 4 common mistakes and the fix
• A diagram of every state
• 32 lines of example code with 4 checks that pass
• How your AI shows you that it works

Say this to your AI

Use the Spielerando entry "Spot impossible scores before they reach the leaderboard" (read_entry score-plausibility-ceiling-check) in my game. Build it step by step, and show me how you checked that it works.

Or skip this and connect the MCP: your AI then finds all of this by itself.Connect the MCP