A novel pursuit-evasion differential game involving three agents is considered. An Attacker missile is pursuing a Target aircraft. The Target aircraft is aided by a Defender missile launched by, say, the wingman, to intercept the Attacker before it reaches the Target aircraft. Thus, a team is formed by the Target and the Defender which cooperate to maximize the separation between the Target aircraft and the point where the Attacker missile is intercepted by the Defender missile, while at the same time the Attacker tries to minimize said distance. A long-range Beyond Visual Range engagement which is in line with current CONcepts of OPeration is envisaged, and it is therefore assumed that the players have simple motion kinematics a la Isaacs. Also, the speed of the Attacker is equal to the speed of the Defender and the latter is interested in point capture. It is also assumed that at all time the Attacker is aware of the Defender’s position, i.e., it is a perfect information game. The analytic/closed-form solution of the target defense pursuit-evasion differential game delineates the state space region where the Attacker can reach the Target without being intercepted by the Defender, thus disposing of the Game of Kind. The target defense Game of Degree is played in the remaining state space. The analytic solution of the Game of Degree yields the agents’ optimal state feedback strategies, that is, the instantaneous heading angles for the Target and the Defender team to maximize the terminal separation between Target and Attacker at the instant of interception of the Attacker by the Defender, and also the instantaneous optimal heading for the Attacker to minimize said separation. Their calculation hinges on the real-time solution of a quartic equation. In this paper we contribute to the solution of a differential game with three states—an additional example to the, admittedly small, repertoire of pursuit-evasion differential games in 3-D which can be solved in closed form.