Search for a Moving Element
Alexey Lebedev · 2020
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√n. Also we give an optimal strategy for non-adaptive case with the minimal number of tests.