Two armies are advancing on two cities. The first army is commanded by General Custard and has four regiments; the second army is commanded by General Peabody and has three regiments. At each city, the army that sends more regiments to the city captures both the city and the opposing army’s regiments. If both armies send the same number of regiments to a city, then the battle at the city is a draw. Each army scores 1 point per city captured and 1 point per captured regiment. Assume that each army wants to maximize the difference between its reward and its opponent’s reward. Formulate this situation as a two-person zero-sum game and solve for the value of the game and each player’s optimal strategies.