
Problem Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an
grid. The first player (if any) to occupy a set of
cells having no two cells in the same row or column is the winner. What is the outcome of the game given optimal play?


Bibliography
* indicates original appearance(s) of problem.