Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
-
Updated
Aug 6, 2022 - Python
Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
Unbeatable Tic-tac-toe A.I. can calculate the best moves using Minimax algorithm. Built in Python using Pygame library.
The repository contains computer vs computer and Player vs Computer Tic Tac Toe Game. Its a non GUI output based python code that'll let you play this game upon executing the code.
This is a tic tac toe game with an integrated AI that allows users to be able to face against it.
This repository contains a Python implementation of the classic game Tic Tac Toe with AI opponent. The game is played on a 3x3 grid by two players, one using 'X' and the other using 'O'. The player who first gets 3 of their marks in a row (up, down, across, or diagonally) is the winner.
tictactoe game, play against ai with minimax algo
Basic Q Learning algorithm on Tic-tac-toe game
A collection of games accompanied by a generalised Monte Carlo Tree Search Artificial Intelligence in combination with Upper Confidence Bounds.
Реализация крестики-нолики на python'e с использованием UI на Tkinter
Add a description, image, and links to the tictactoe-ai topic page so that developers can more easily learn about it.
To associate your repository with the tictactoe-ai topic, visit your repo's landing page and select "manage topics."