[math-fun] Progress on non-attacking queens game?

I'm wondering if any progress has been made on the non-attacking queens game described in the May 2006 issue of The College Mathematics Journal. "Two players successively place queens on the board so that no two attack each other. The winner is the player who places a queen so that all remaining squares are attacked, ..." For square boards, n x n, with n odd, there is a simple strategy for player 1 to win. The authors report that player 1 also wins with n = 2, 4, 6 and 8, but that a winning strategy exists for player 2 for n = 10! That was as far as they took the analysis. Paul