0-miniproject sem 4 review 1(1)(2).pptx

tic- tac- toe in python
(using minimax algorithm)
PRESENTED BY:
ABDUS SUBHAN
1CR20EC003
AADITHYA D KUMAR
1CR20EC002
ABHISHEK KUMAR SINGH
1CR20EC006
Project Advisor :
PROF. JYOTI M.R.

Pre-requisites
 Python compiler
 Python programming
 Minimax Algorithm in Game Theory

strategy
1
 Optimal strategy for player X. In each grid, the shaded red X denotes the optimal move, and
the location of O's next move gives the next subgrid to examine. Note that only two sequences
of moves by O (both starting with center, top-right, left-mid) lead to a draw, with the remaining
sequences leading to wins from X.
A player can play perfect tic-tac-toe (win or draw) given they choose the first possible move
from the following list.
Win: If the player has two in a row, he or she can place a third to get three in a row.
Block: If the [opponent] has two in a row, the player must play the third himself or herself to
block them.
Fork: Creation of an opportunity where the player has two threats to win (two non-blocked lines
of 2).

strategy
1
 Blocking an opponent's fork:
Option 1: The player should create two in a row to force the opponent into defending, as
long as it doesn't result in them creating a fork. For example, if "X" has a corner, "O" has the
center, and "X" has the opposite corner as well, "O" must not play a corner in order to win.
(Playing a corner in this scenario creates a fork for "X" to win.)
Option 2: If there is a configuration where the opponent can fork, the player should block
that fork.
Center: A player marks the center. (If it is the first move of the game, playing on a corner
gives "O" more opportunities to make a mistake and may therefore be the better choice;
however, it makes no difference between perfect players.)
Opposite corner: If the opponent is in the corner, the player plays the opposite corner.

introduction
1
 Because of the simplicity of tic-tac-toe, it is often used as a pedagogical
tool for teaching the concepts of good sportsmanship and the branch
of artificial intelligence that deals with the searching of game trees. It
is straightforward to write a computer program to play tic-tac-toe
perfectly or to enumerate the 765 essentially different positions (the
state space complexity) or the 26,830 possible games up to rotations
and reflections (the game tree complexity) on this space. If played
optimally by both players, the game always ends in a draw, making tic-
tac-toe a futile game.

The Minimax Algorithm
1
 Minimax Algorithm is a decision rule formulated for two player zero-
sum games (Tic-Tac-Toe, Chess, Go, etc.).
 This algorithm sees a few steps ahead and puts itself in the shoes of its
opponent. It keeps playing and exploring subsequent possible states until
it reaches a terminal state resulting in a draw, a win, or a loss.
 Being in any of these possible terminal states has some utility for the AI
— such as being in a ‘Win’ state is good (utility is positive), being in a ‘Loss’
state is bad (utility is negative), and being in a draw in neither good nor
bad (utility is neutral).

algorithm
 In our execution of the Minimax algorithm for solving Tic-Tac-Toe, it
works by visualizing all future possible states of the board and
constructs it in the form of a tree. When the current board state is given
to the algorithm (the root of the tree), it splits into ’n’ branches (where
n denotes the number of moves that can be chosen by the AI/number
of empty cells where the AI can be placed). If any of these new states is
a terminal state, no further splits are performed for this state and it is
assigned a score the following way:
 Score = +1 (if AI wins) Score = -1 (if AI loses) Score= 0 (If a draw happens)
6

Pre-Requisite Before Coding
9/28/2023
Board
Display board
Play game
Check win:
1)Row win
2)Column win
3)Diagonal win
Check tie
Flip player

OUTPUT 2 (Column win)
9/28/2023

OUTPUT 3 (Diagonal win)
9/28/2023

OUTPUT 4 (Invalid inputs)
9/28/2023

APplications
1
Various game shows have been based on Tic-Tac-Toe and its variants:
On Hollywood Squares, nine celebrities filled the cells of the tic-tac-toe grid; players
put symbols on the board by correctly agreeing or disagreeing with a celebrity's
answer to a question. Variations of the show include Storybook Squares and Hip Hop
Squares.
In Tic-Tac-Dough, players put symbols up on the board by answering questions in
various categories, which shuffle after each player's turn.
In Beat the Teacher, contestants answer questions to win a turn to influence a tic-tac-
toe grid.

limitations
 The game cannot be played by more than one players.
 It is not a high level game.
 It doesn’t contain levels.
7

References
 https://youtu.be/BHh654_7Cmw
 Minimax Algorithm in Game Theory | Set 3 (Tic-Tac-Toe AI – Finding optimal
move)- Geeks for Geeks
https://www.geeksforgeeks.org/minimax-algorithm-in-game-theory-set-3-
tic-tac-toe-ai-finding-optimal-move/
 Tic Tac Toe AI with MiniMax using Python | Part 1: Programming Tic Tac Toe-
YouTube
https://www.youtube.com/watch?v=JC1QsLOXp-I
 Tic Tac Toe AI with MiniMax using Python | Part 2: Minimax- YouTube
https://www.youtube.com/watch?v=2Tr8LkyU78c 7

0-miniproject sem 4 review 1(1)(2).pptx

More Related Content

Similar to 0-miniproject sem 4 review 1(1)(2).pptx (20)

Recently uploaded (20)

0-miniproject sem 4 review 1(1)(2).pptx