Question: Four army divisions attack a town along two possible roads. The town has three divisions defending it. A defending division is dug in and hence equivalent to two attacking divisions. Even one division attacking an undefended road captures the town. Each commander must decide how many divisions to attack or defend each road. If the attacking commander captures a road to the town, the town falls. Score 1 to the attacker if the town falls and -1 if it doesn't.
(a) Find the payoff matrix with payoff the attacker's probability of winning the town.
(b) Find the value of the game and the optimal saddle point.