This paper solves the Watchman Route Problem (WRP) on a general discrete graph with Heuristic Search. Given graph, line-of-sight (LOS) function, and start vertex, task is to (offline) find (shortest) path through such that all vertices in will be visually seen by at least one vertex path. WRP reminiscent but different from covering mapping problems, which are done online an unknown graph. We fo...