We consider the watchman route problem for multiple watchmen in staircase polygons, which are rectilinear x- and y-monotone polygons. For two watchmen, we propose an optimal algorithm that takes quadratic time, improving on the cubic time of the trivial solution. For m ≥ 3 watchmen, we explain where our approach fails.