C++ version #5
Open
C++ version #5
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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.