Existence, Uniqueness and Counterexamples · Superchallenge problem

In $3 \times 3$ Chomp the first player can force a win (by strategy stealing). How many squares does the winning first move eat? (There is exactly one winning first move.)