Skip to content

This project utilizes the Minimax algorithm to create a challenging artificial intelligence for the classic Tic Tac Toe game.

License

Notifications You must be signed in to change notification settings

kedyjs/X-O-X-AI

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 

History

8 Commits
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

๐ŸŽฎ Tic Tac Toe AI ๐Ÿค–

Welcome to the Tic Tac Toe AI project! This project utilizes the Minimax algorithm to create a challenging artificial intelligence for the classic Tic Tac Toe game.

๐Ÿš€ Features

  • Minimax Algorithm: Implements the Minimax algorithm to determine the best move.
  • Player vs AI: Allows a human player to play against the AI.
  • Interactive Gameplay: Provides a simple and interactive command-line interface for gameplay.

๐Ÿ› ๏ธ Setup

Prerequisites

  • Python (3.8 or higher)

Installation

  1. Clone this repository:
    git clone https://github.com/kedyjs/tic-tac-toe-ai

๐ŸŽฎ How to Play

  • The game is played on a grid that's 3 squares by 3 squares.
  • You are X, and the AI is O. Players take turns putting their marks in empty squares.
  • The first player to get 3 of their marks in a row (up, down, across, or diagonally) is the winner.
  • When all 9 squares are full, the game is over.

๐Ÿ“– Algorithm

This project uses the Minimax Algorithm which is a decision-making algorithm, used in two-player games like Tic Tac Toe. It computes the minimax decision from the current state, which will be used to determine the AI's move.

About

This project utilizes the Minimax algorithm to create a challenging artificial intelligence for the classic Tic Tac Toe game.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages