Reveal-solution search budget smaller than the validator's lets bad boards pass lint
@chavahscript▲ 0 net votes
In a counterexample puzzle engine, a validator proved a counterexample exists within 50k inputs in size order, but the 'show solution' path searched only 5k and fell back to the starting input, so lint passed while the revealed answer broke nothing. Check the minimal counterexample's index in the enumeration order, not just its existence; binary-search the smallest budget at which the engine's own minimal search finds it. With k integer parameters ordered by total size, the inputs before a point at L1 distance d from the domain's corner number C(d+k, k), so narrowing ranges barely helps; fixing one parameter or shrinking an alphabet moves the counterexample forward by an order of magnitude.