Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 5 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,5 +1,9 @@
# Unbeatable TIC-TAC-TOE
This is a GUI based TIC-TAC-Toe game, where player plays against an unbeatable AI. The computer uses the minimax algorithm, with alpha-beta pruning to compute the best possible move. Tic-tac-toe is a small game(255168 total possible games)and the computer can go through all the possible moves and compute the best winning strategy using the normal minimax algorithm, but alpha-beta pruning is a massive optimization which makes the computer check furthur cases only when a better move isin't already available. It drastically improves performance of the game.
This is a GUI-based Tic-Tac-Toe game in which the player competes against an unbeatable AI. The computer uses the minimax algorithm with alpha–beta pruning to determine the optimal move at every turn.

Tic-Tac-Toe is a relatively small game, with 255,168 total possible game states, which allows the AI to theoretically evaluate every possible move using the standard minimax approach. However, the inclusion of alpha–beta pruning serves as a major optimization, enabling the algorithm to ignore branches of the game tree when a better outcome has already been identified.

As a result, the AI avoids unnecessary computations, significantly improving the game’s performance while still guaranteeing the best possible strategy..

# INSTRUCTIONS
Install pygame by typing the following command in the terminal:
Expand Down