Bounds for cops and robber pursuit
نویسندگان
چکیده
We prove that the robber can evade (that is, stay at least unit distance from) at least bn/5.889c cops patroling an n × n continuous square region, that a robber can always evade a single cop patroling a square with side length 4 or larger, and that a single cop on patrol can always capture the robber in a square with side length smaller than 2.189 · · · .
منابع مشابه
Pursuit and Evasion from a Distance: Algorithms and Bounds
Cops and Robber is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robber, distance k Cops and Robber, where the cops win if they are distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops needed to capture the robber in G. The distance k analogue of the cop number, written ck(G), equa...
متن کاملImproved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that bn/ √ 5c+ 1 cops can capture a robber in a square with side length n. We extend these results to three dimensions, proving that 0.34869 · · ·n2 +O(n) cops can capture a robber in a n× n× n cube and that a robber can forev...
متن کاملCops, Robber, and Alarms
The two games considered are mixtures of Searching and Cops and Robber. The cops have partial information, provided first via selected vertices of a graph, and then via selected edges. This partial information includes the robber's position, but not the direction in which he is moving. The robber has perfect information. In both cases, we give bounds on the amount of such information required b...
متن کاملZero-visibility cops & robber and the pathwidth of a graph
We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zerovisibility copnumber in terms of the pathwidth.
متن کاملA cops and robber game in multidimensional grids
We theoretically analyze the Cops and Robber Game for the first time in a multidimensional grid. It is shown that for an ndimensional grid, at least n cops are necessary to ensure capture of the robber. We also present a set of cop strategies for which n cops are provably sufficient to catch the robber. Further, for two-dimensional grid, we provide an efficient cop strategy for which the robber...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 43 شماره
صفحات -
تاریخ انتشار 2010