On Ruckle's Conjecture on Accumulation Games

In an accumulation game, the Hider secretly distributes his given total wealth $h$ among $n$ locations, while the Searcher picks $r$ locations and confiscates the material placed there. The Hider wins if what is left at the remaining $n-r$ locations is at least 1; otherwise the Searcher wins. Ruckle's conjecture says that an optimal Hider...