Nash Equilibrium for Terminal Maneuvers
Summary
The article analyzes a two-player zero-sum game called Terminal Maneuvers, focusing on terminal-round endgames to derive Nash equilibrium strategies. Through backward induction and linear programming, it demonstrates how both players' optimal mixed strategies render the opponent indifferent, yielding precise win-rate distributions (e.g., Missile ~32.3% starting with seven fuel, Laser ~67.7%). It also discusses the indifference principle and the equivalence of minimax, maximin, and Nash in zero-sum games.