如何遍历矩阵并找到匹配值

Question

def is_win(self, player):
    for x,y,z in [
        [0, 1, 2],
        [3, 4, 5],
        [6, 7, 8],
        [0, 3, 6],
        [1, 4, 7],
        [2, 5, 8],
        [0, 4, 8],
        [2, 4, 6],
    ]:

    if x == player and y == player and z == player:
         return True

I am trying to form a win condition on Tic Tac toe. But this will not match. I have a update_board function that checks if is_win after updating a players move.

Answer 1

You should set your player to contain a set of positions. Then, you check if any row in your matrix is in the player's positions.

# assuming player.positions is a set()
def is_win(self,player):
    win_matrix = [set([0, 1, 2]),set([3, 4, 5]),set([6, 7, 8]),set([0, 3, 6]),\
                 set([1, 4, 7]),set([2, 5, 8]),set([0, 4, 8]),set([2, 4, 6])]
    for w in win_matrix:
        if(w.issubset(player.positions)):
            return True
    return False