Tic tac toe AI

implementation of tic-tac-toe m, n, k with IA and algorithms minimax and pruning alphabeta. Develop an algorithm in python, java,C# or C++ console should receive as input the dimensions m, n, j (the player),

the constant k is a state of the game Tic-tac-toe. The player "X" is represented by the integer 1, the player "O" by the integer 2 and blank positions on the board by the integer 0. Example of Possible valid entries include:

input terminal / console

with passage of arguments:

Example of a 3 3 entry, k = 3 being played by "X". ./a.out 3 3 1 3 0 0 0 0 0 0 0 0 0 Example of a 3 3 entry, k = 3 being played by "O". ./a.out 3 3 2 3 1 1 2 0 0 0 2 1 0 Example of a 4 4 entry, k = 2 being played by "O". ./a.out 4 4 2 2 1 2 1 2 0 0 0 0 0 0 0 0 0 0 1 0

output terminal / console:

The algorithm developed should print on the standard output of the operating system the result of the game played by the BOT through a pair of indices ij, where (i Example of a valid output: 1 1 Example of a valid output: 2 1