We explore structure of Nash equilibria of a defensive two-resource allocation game. A fast algorithm is developed with intuition that stems from the revealed structure. Experiments show an order-of-magnitude improvement over a state-of-the-art LP solver. Experiments show that it outperforms a method based on Megiddo and Ichimori (1985).