The goal of this exercise is to produce a function in the language of your choice that will take as input an NxN grid containing any combination of Xs, Os, and empty spaces, and return one of the following states below.

Possible States: X-Winner, O-Winner, Tie, Inconclusive

Example Boards:

X | X | X
  |   | 
  |   |  


O |   | X
O |   | 
O |   | O


X | O | X
X | X | O
O | X | X


X | O | X
O | X | X
O | X | O


X |   | X
O |   | 
  | X |  


X | O | X
O | X | 
O | X | O