# Watchman Problem

The Watchman Problem is an optimization problem in computational geometry where the objective is to compute the shortest route a watchman should take to guard an entire area with obstacles given only a map of the area.

### Related

Art Gallery Problem involves viewing all points of a given area, but with multiple stationary watchmen.