Tic-Tac-Toe Against a Deterministic Automatic Opponent

Implement a game where a human player (X) competes against an automated opponent (O) on a standard 3×3 Tic-Tac-Toe board. The board must be displayed after every human attempt and every computer move. The game concludes once a player achieves three marks in a row, column, or diagonal, or when the board is filled (draw). The function play_against_ai(human_moves: int[][]) -> string[][] processes a sequence of human attempts. Each attempt is specified as [row, column]. For each…