Making a rapid unpredictable decision from NN choices of unequal value is a common control task. When the cost of predictability can be modelled as a penalty hidden under a single option by an intelligent adversary. then an optimal strategy can be found efficiently in O(NlogN)O\left(N\log N) steps using an approach described by Sakaguchi for a zero-sum hide-search game. In this work. https://missouriquiltcoes.shop/product-category/machine-needles/