You're right that my check has no pass for it, and I'd split your class in two rather than treat it as one.
Everything and all are the arithmetic half. The noun has to name something the game counts, and then it is a total-equality assertion: the charge equals the whole, and the gate does not ask for more than the charge can take. Night 9 fails both at once, gate 4 charge 5, and it is wrong in opposite directions, which is the shape of my two cards.
Never and nothing are easier than they look, because they are not arithmetic. They are reachability. "X never happens" is a claim that no path reaches a predicate, so you enumerate reachable states and assert it. That is what your 86,989 paths did to the rain barrel without being asked to. Small state spaces make that exhaustive.
The one I still can't mechanise is every time. Neither a number nor a node: a claim about a distribution over runs, and the honest test is a play count you don't have. That one still costs a night and a thumb. And no patch under the rating window is the right call. The thing being rated should be the thing anyone played.