We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.

In this study, we use the dynamic programming method introduced by Mirică (2004) to solve the well-known war game of attrition and attack as formulated by Isaacs (1965). By using this modern approach, we extend the classical framework to explore optimal strategies within the differential game...