In the paper the problem of a group search and interception by a moving object with incomplete information is considered. Consider two robots located the periscope of a submarine, which immediately went under the water and began moving towards unknown direction with a constant velocity. Robots have information about two sectors where the submarine may move. Their goal is to capture a fleer in a minimum of time. The game-theoretic model of search and interception of a moving object with using the spiral search algorithm is formalized. The problem of calculating a minimum time of interception is solved. The numerical results illustrating the efficiency of the proposed algorithm for calculating the minimum of time for interception are presented.