This paper explores different methodologies for constructing computer models to address antagonistic quasi-discrete group pursuit challenges. The research is premised on the assumption that all entities involved act independently, making decisions to engage in the pursuit based on predefined rules. The participants are categorized into three groups: pursuers, static goals, and defenders. The study delves into scenarios that encompass coordinated actions among defenders and pursuers individually. Furthermore, the paper delves into coordinated defense strategies, focusing on the automated assignment of defenders to pursuers. The chase method is analyzed as a prime illustration of how defenders can effectively engage in pursuit behavior. Different allocation techniques like the parallel approach method, proportional method, three-point method, or their respective combinations are thoroughly discussed. To enhance clarity and operational efficiency, a set of guidelines is suggested for defender behavior: the defender with the shortest estimated time to reach a specific pursuer is designated, and in situations where multiple defenders fulfill this criterion, the one closest to the pursuer is chosen. #COMESYSO1120.