Search strategies in the game with a team of pursuers and one evader on the plane

We consider a differential simple search game without phase constraints on the plane. Each pursuer from the team chooses an initial position and piecewise constant strategy. As an example, the game of simple search of immobile hider (evader) on the plane is considered, and the necessary conditions for detection are found. For cases with two and three pursuers, a comparison of the detection time of the evader was made and approximate information sets numerically constructed.