The capture time of grids

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 if there are two cops in the game, then the length of the game (known as the 2-capture time of the graph) is equal to half the diameter of the graph. In particular, the 2-capture time of the m × n grid is proved to be ⌊ m + n 2 ⌋ − 1 .