python

Develop a tic-tac-toe (X-O) game using Python. The first player (X) is a human and the second player (O) is the computer that uses an alpha-beta pruning algorithm to choose the next move. You are given a notebook and asked to implement the MiniMaxABO function. Sample Output: D Pick a position(1-9): 1 1 x 1 1 1 111111 III Pick a position(1-9): 8 1 x || 0 || 1 1 1 0 11 Pick a position(1-9): 6 1 x || 0 || 1 | 0 || 0 || X 1 | || X 111 111 x 111 1 x || 0 || x1 1 x II III 1110111 II III | 0 || 0 || 1 1 x || 0 || X1 1 0 1 0 1 1 | || X 1101 Pick a position(1-9): 3 1 x | 111 0111 111 111 Pick a position(1-9): 6 1 x || 0 || 1 | 0 | 0 || X1 1 | x 111 Pick a position(1-9): 7 1 x 110 111 1 0 1 0 1 1 1 x || X 1101 | x || 0 || x1 Draw 110111 1 x || 0 || 10 || 0 || 1 | || X 1101