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.