Abstract
We consider the moving element search problem with the minimum total cardinality of tests. As a search space, we consider the set of integer points of a segment of length n. We prove that the total test cardinality of an asymptotically optimal adaptive strategy is $$n + 2\sqrt n $$.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have