Putnam 2002 A4
- Session A
In Determinant Tic-Tac-Toe, Player 1 enters a 1 in an empty matrix. Player 0 counters with a 0 in a vacant position, and play continues in turn until the matrix is completed with five 1's and four 0's. Player 0 wins if the determinant is 0 and player 1 wins otherwise. Assuming both players pursue optimal strategies, who will win and how?
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by Kiran Kedlaya and Lenny Ng
The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).
Similar problems
These problems have the most words in common with this statement.