  This paper intends to solve the Transversal achievement on an n times n grid
problem proposed by Dr. Martin Erickson. We approach the problem using
mathematical induction and case analysis and prove the hypothesis that for all
n greater than 1, the game is a draw.
