Summation of every row, column and diagonal in a 3x3 matrix numpy
set a bool to checks every turn if someone has won. if it returns true, then whosever turn it is has won
so, for instance, it is x turn, he plays the winning move, bool checks if someone has won,returns true, print out (player whose turn it is) has won! and end game.
My assignment is Tic-Tac_Toe using pygame and numpy. I Have almost all of the program done. I just need help understanding how to find if a winner is found. I winner is found if the summation of ANY row, column, or diagonal is equal to 3. 
I have two 3x3 matrices filled with 0's. Let's call them xPlayer and oPlayer. The matrices get filled with 1 every time player x or player o chooses their choice at a certain location. So if, player x selects [0,0], the matrix location at [0,0] gets a 1 value. This should continue until the summation of any row, column, or diagonal is 3. If All the places in both the matrices are 1, then there is no winner. 
I need help finding the winner. I'm really new to python so I don't know much about indexing though a matrix. Any help would be greatly appreciated! 
EDIT: Basically, how do you find out the summation of every row, column, and diagonal to check if ANY of them are equal to 3.