#include iostream#include vector#include climitsconst int SIZE = 15; 棋盘大小enum class Player NONE BLACK WHITE;struct Move int row; int col;; 判断棋盘上某位置是否合法bool isValidMoveint row int col

This code is an implementation of a simple Gomoku (Five in a Row) game with an AI opponent. The game is played on a 15x15 board and the player (white) competes against the AI (black) to get five of their pieces in a row, either horizontally, vertically, or diagonally.

The AI opponent uses the minimax algorithm with alpha-beta pruning to determine the best move. The minimax function recursively evaluates the game state by simulating all possible moves and assigning a score to each state. The evaluate function calculates a heuristic score for a given board state, based on the number of pieces in a row for each player.

The getNextMove function uses either the minimax algorithm or alpha-beta pruning algorithm to find the best move for the AI player. It iterates through all possible moves and uses the minimax or alphabeta function to evaluate each move and select the one with the highest score.

The main loop of the game prompts the player for their move, updates the board accordingly, and then calls getNextMove to determine the AI's move. The game continues until a player wins or there is a draw.

Overall, this code provides a basic implementation of a Gomoku game with an AI opponent using the minimax algorithm with alpha-beta pruning for optimal move selection