Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create tic tac toe on minimax algo.cpp #286

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

Amulya77
Copy link

@Amulya77 Amulya77 commented Oct 3, 2021

tic tac toe game with computer using simple algo The classic Tic-Tac-Toe game (also called Noughts and Crosses) or Xs and Os is a paper-and-pencil game for two players, X and O, who take turns marking the spaces in a 3×3 grid. The player who succeeds in placing three of their marks in a horizontal, vertical, or diagonal row is the winner.

In this code, I've used minimax algorithm to help the computer where to go for the next move and win the puzzle.

Combinatorics : When considering only the state of the board, and after taking into account board symmetries (i.e. rotations and reflections), there are only 138 terminal board positions. A combinatorics study of the game shows that when "X" makes the first move every time, the game is won as follows :

91 distinct positions are won by (X) 44 distinct positions are won by (O) 3 distinct positions are drawn (often called a "cat's game") Pseudocode function minimax(node, depth, isMaximizingPlayer, alpha, beta): @Astrodevil

@Astrodevil
Copy link
Owner

Also add a readme with this file and put it inside folder, mention the details as you explained here about this game concept or setup

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants