Date of Original Version
We consider a Cops-and-Robber game played on the subsets of an n-set. The robber starts at the full set; the cops start at the empty set. In each round, each cop moves up one level by gaining an element, and the robber moves down one level by discarding an element. The question is how many cops are needed to ensure catching the robber when the robber reaches the middle level. Alan Hill posed the problem and provided a lower bound of 2n/2 for even n and (n[n/2])2-[n/2] (which is asymptotic to 2[n/2] / √ πn/2) for odd n. Until now, no nontrivial upper bound was known. In this paper, we prove an upper bound that is within a factor of O(ln n) of this lower bound.
Kinnersley, W. B., Prałat, P., & West, D. B. To Catch a Falling Robber. (2016). Theoretical Computer Science, 627, 107-111. doi: 10.1016/j.tcs.2016.02.030
Available at: http://dx.doi.org/10.1016/j.tcs.2016.02.030
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.