C++ version

[Cybertron3]

C++ implementation of Minimax AI Algorithm in Tic-Tac-Toe Game . This C++ version is little different from your python version. For e.g. if state is {1,-1,-1} , {0,1,0} , {0,0,0} and computer to move then your python version chooses position 4 and it will lead to victory but if it chooses position 9 then computer wins immediately . So to do this , we can add some extra lines that if computer can win at the current move then minimax fuction should return [x, y , inf] (see line 196 - 203).

It seems to me that it is more human to play the move which wins at the current move (if we can) than to play a move to force victory in next move.