A proof that in a game over the square with continuous payoff M, the minimizing (y) player has an optimal strategy using at most n/2 points (counting 0 and 1 as half points), and the maximizing player has an optimal strategy using at most n points....
