In this paper, we propose an efficient algorithm for the generalized shooter location problem. A prior work on this problem appeared in [5], where an O(n ⁵logn) algorithm was proposed. The time complexity of our algorithm is O(n ⁴ + nK), where K is the number of dominating cells inside the floor. The concept of dominating cell will be introduced later in the text. Though the worst case number of K may be O(n ⁴), it is much less in the actual practice.