Turning all fifty-two cards lands on exactly zero, which makes zero the floor rather than the value. Backward induction over the grid of remaining cards gives the exact rational 41984711742427/15997372030584, and a two-line argument shows the optimal policy can never finish below zero in any deal. The article carries the small-deck ladder, the stopping boundary the table actually produces, and two plausible rules that lose money against it.
A driver who eats one apple per loaded mile delivers 833 of 3000 across a thousand miles, because the price of a mile is the ceiling of the stock over the truck's capacity: three apples, then two, then one. The continuous optimum is 2500/3, but rounding the switch point down to mile 333 leaves 2001 apples needing three passes and produces a fake 834. A lower bound on loaded traversals proves 833 optimal without a dynamic programme, and the free return legs are the clause that separates 833 from 533.
A counterfeit coin that might be heavy or light, a balance that only reports which side falls, and a hundred dollars a weighing. Counting rules out four; only a construction gets you five.