以下是基于极大极小搜索算法（Minimax Algorithm）的一个简单井字棋游戏的Python代码示例： ```python import math def print_board(board): for row in board: print(" ".join(row)) print() def check_winner(board): # 检查行、列和对角线是否有胜者 for i in range(3): if board[i][0] == board[i][1] == board[i][2] != '-': return board[i][0] if board[0][i] == board[1][i] == board[2][i] != '-': return board[0][i] if board[0][0] == board[1][1] == board[2][2] != '-' or \ board[0][2] == board[1][1] == board[2][0] != '-': return board[0][0] if all([cell != '-' for row in board for cell in row]): return 'DRAW' return None def minimax(board, depth, is_maximizing): result = check_winner(board) if result is not None: score_map = {'X': 1, 'O': -1, 'DRAW': 0} return score_map[result] if is_maximizing: best_score = -math.inf for i in range(3): for j in range(3): if board[i][j] == '-': board[i][j] = 'X' score = minimax(board, depth + 1, False) board[i][j] = '-' best_score = max(score, best_score) return best_score else: best_score = math.inf for i in range(3): for j in range(3): if board[i][j] == '-': board[i][j] = 'O' score = minimax(board, depth + 1, True) board[i][j] = '-' best_score = min(score, best_score) return best_score def find_best_move(board): best_score = -math.inf move = (-1, -1) for i in range(3): for j in range(3): if board[i][j] == '-': board[i][j] = 'X' score = minimax(board, 0, False) board[i][j] = '-' if score > best_score: best_score = score move = (i, j) return move # 初始化空棋盘 board = [['-' for _ in range(3)] for _ in range(3)] print("欢迎来到井字棋游戏!") player_symbol = input("请选择你的角色 X 或 O：").strip().upper() if player_symbol != 'X' and player_symbol != 'O': print("无效的选择，默认为你选择 O") player_symbol = 'O' ai_symbol = 'X' if player_symbol == 'O' else 'O' while True: print_board(board) winner = check_winner(board) if winner: if winner == 'DRAW': print("平局！") elif winner == ai_symbol: print("电脑赢了！") else: print("玩家赢了！") break if player_symbol == 'X': x, y = map(int, input(f"请输入你要下的位置 (x,y): ").split(",")) while board[x][y] != '-': print("该位置已被占用，请重新输入:") x, y = map(int, input(f"请输入你要下的位置 (x,y): ").split(",")) board[x][y] = player_symbol else: move = find_best_move(board) board[move[0]][move[1]] = ai_symbol print(f"电脑下在 {move[0]}, {move[1]}") winner = check_winner(board) if winner: if winner == 'DRAW': print("平局！") elif winner == ai_symbol: print("电脑赢了！") else: print("玩家赢了！") break if ai_symbol == 'X': move = find_best_move(board) board[move[0]][move[1]] = ai_symbol print(f"电脑下在 {move[0]}, {move[1]}") ``` ### 功能说明： - **用户输入**：通过键盘输入落子的位置 `(x, y)` 来完成人机交互。 - **计算机策略**：利用 Minimax 算法计算最佳走位。