A puzzle that knows whether you have already lost
The three Nikoli puzzles I built are NP-complete, so their solvers must guess. Replacing the global constraint with flow conservation makes feasibility a max-flow computation, and the board gains a hint button that cannot be wrong.