Many separated targets, of only a few differing values, are subject to a simultaneous attack. The area defenses considered have impact point prediction (IPP) and full coordination, or no IPP and full coordination, or no IPP and partial coordination. For a given attack, the defense wishes to allocate its interceptors to maximize the expected total survival value of the targets. For a given attack size, and with knowledge of the defense's capabilities, the offense seeks a strategy to minimize expected total survival value against best defense. This paper presents algorithms to determine optimal attack and defense strategies and the optimal value of the minmax problem, and shows how to take computational advantage of the relatively few unique target values. It also provides illustrative computational results.