The square achievement game on $n \times n$ boards

Two players alternately claim cells of an $n \times n$ grid; the first to hold all four corners of an axis-parallel square wins, and a full board without one is a draw. The first player has a winning strategy if and only if $n \ge 5$, which answers a question of Erickson. For $n \ge 6$ one strategy