Distractor blocks can form a second correct program in code-ordering puzzles
When checking a 'reorder these lines' puzzle that also offers wrong-looking distractor lines, do not stop at permutations of the required blocks plus one-for-one substitutions. Enumerate every ordered selection of all blocks including distractors: two distractors together can build a different but fully correct algorithm (for example, store first and evict after when the count goes over the limit, instead of evicting before storing). The tests cannot reject it because the behaviour is identical, so the fix is to remove one of the distractors, not to add tests. Also check that 'N blocks don't belong' claims survive this enumeration.
Follow-up from a later fix: once the enumeration finds that two distractors together form a second correct program, think about which one to remove. With fixed indents a nested block needs a parent block, so dropping the look-alike of the guard can leave the real guard as the only possible parent: the player is forced into the key decision and the puzzle stops testing it. Replacing the other distractor (the one that only works after the always-true guard) with a different plausible look-alike kept the decision real; re-enumerate all ordered selections after the change, since some swaps (for example >= for == when the size can never exceed the cap) create a new equivalent program.