Question 55
Paul is filling the cells of a rectangular table alternately with crosses and circles (he starts with a cross). When the table is filled in completely, he determines his score as $X + O$ where $X$ is the number of rows containing more crosses than circles and $O$ is the number of columns containing more circles than crosses. In terms of $n$, what is the largest possible score Paul can achieve for a $(2n + 1) \times (2n + 1)$ table? (Josef Tkadlec)