MathDB
Putnam 2002 A4

Source:

March 12, 2012
Putnamlinear algebramatrixsymmetrycollege contestsPutnam games

Problem Statement

In Determinant Tic-Tac-Toe, Player 11 enters a 11 in an empty 3×33 \times 3 matrix. Player 00 counters with a 00 in a vacant position and play continues in turn intil the 3×3 3 \times 3 matrix is completed with five 11’s and four 00’s. Player 00 wins if the determinant is 00 and player 11 wins otherwise. Assuming both players pursue optimal strategies, who will win and how?
Back to ProblemsView on AoPS