A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Given a set of searchers in the grid, whose search paths are known in advance, can a target that moves at the same speed as the searchers escape detection indefinitely? We study the number of searchers against which the target can still escape. This number is less than n in an n × n grid, since a row of searchers can sweep the allowed region. In an alternating-move-model where at each time searchers first move and then the target moves, we show that a target can always escape n 2 searchers anddoi:10.1016/j.comgeo.2008.08.001 fatcat:ogx5begjize3bmnpv25n5ae664