We consider a variant of the 2-watchmen problem that ensures that every point in a polygon P is seen from more than one direction: we search for routes W1, W2, such that for each p ∈ P there exist w1 ∈ W1, w2 ∈ W2 that see p and such that p ∈ w1w2 ⊂ P. We show that finding the two routes that are optimal with respect to the min-max criterion is NP-hard in simple polygons and present a 2-approximation algorithm for this case; moreover, we provide a polynomial-time algorithm for computing the two optimal routes with respect to the min-sum criterion in convex polygons. Finally, we discuss a generalized version of the problem with more than two watchmen.