The code implements Minimax algorithm with Alpha-Beta pruning and gives the best next move for the specified player.
Input :
Player i.e. X or O
Board configuration
Output:
Next selected move
Testcase:
Input:
X
XXO
XO_
_OX
Output:
2 0
angad-kalra/AlphaBetaMinimax
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|