The capture time of grids.

Authors: Abbas Mehrabian
Subjects: Combinatorics
link: http://arxiv.org/abs/1008.4424
Abstract

We consider the game of Cops and Robber played on the Cartesian product of
two trees. Assuming the players play perfectly, it is shown that the length of
the game (known as the capture time of the graph) is equal to half the diameter
of the graph. In particular, the capture time of the m x n grid is proved to be
floor ( (m+n-2)/2 ).