五子棋游戏胜利判断算法 - Python 实现

over_pos = []

def check_win(over_pos): # 判断五子连心 mp = np.zeros([15, 15], dtype=int) for val in over_pos: x = int((val[0][0] - 27) / 44) y = int((val[0][1] - 27) / 44) mp[x][y] = val[1] # 检查横向 for i in range(15): for j in range(11): if mp[i][j] == mp[i][j+1] == mp[i][j+2] == mp[i][j+3] == mp[i][j+4] and mp[i][j] != 0: return True # 检查竖向 for i in range(11): for j in range(15): if mp[i][j] == mp[i+1][j] == mp[i+2][j] == mp[i+3][j] == mp[i+4][j] and mp[i][j] != 0: return True # 检查斜向 for i in range(11): for j in range(11): if mp[i][j] == mp[i+1][j+1] == mp[i+2][j+2] == mp[i+3][j+3] == mp[i+4][j+4] and mp[i][j] != 0: return True for i in range(11): for j in range(4, 15): if mp[i][j] == mp[i+1][j-1] == mp[i+2][j-2] == mp[i+3][j-3] == mp[i+4][j-4] and mp[i][j] != 0: return True return False