Next Article in Journal
Featured-Based Algorithm for the Automated Registration of Multisensorial / Multitemporal Oceanographic Satellite Imagery
Next Article in Special Issue
Optimal 2-Coverage of a Polygonal Region in a Sensor Network
Previous Article in Journal
Radial Basis Function Cascade Correlation Networks
Open AccessArticle

How Many Lions Are Needed to Clear a Grid?

Institute of Computer Science, University of Bonn, 53117 Bonn, Germany
*
Author to whom correspondence should be addressed.
Algorithms 2009, 2(3), 1069-1086; https://doi.org/10.3390/a2031069
Received: 30 July 2009 / Revised: 3 September 2009 / Accepted: 4 September 2009 / Published: 7 September 2009
(This article belongs to the Special Issue Computational Geometry)
We consider a pursuit-evasion problem where some lions have the task to clear a grid graph whose nodes are initially contaminated. The contamination spreads one step per time unit in each direction not blocked by a lion. A vertex is cleared from its contamination whenever a lion moves to it. Brass et al. [5] showed that n/2 lions are not enough to clear the n x n-grid. In this paper, we consider the same problem in dimension d > 2 and prove that Θ(nd-1/√d) lions are necessary and sufficient to clear the nd-grid. Furthermore, we analyze a problem variant where the lions are also allowed to jump from grid vertices to non-adjacent grid vertices. View Full-Text
Keywords: lion and man; safe path planning; avoidance number; pursuit games; graph separator; graph search; isoperimetric inequality lion and man; safe path planning; avoidance number; pursuit games; graph separator; graph search; isoperimetric inequality
Show Figures

Figure 1

MDPI and ACS Style

Berger, F.; Gilbers, A.; Grüne, A.; Klein, R. How Many Lions Are Needed to Clear a Grid? Algorithms 2009, 2, 1069-1086.

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop