Minimax is a AI algorithm.
-
Updated
Dec 27, 2023 - Python
Minimax is a AI algorithm.
a basic adversarial game
AI bots playing Tic Tac Toe
CSE 571 Artificial Intelligence
Unbeatable Tic-tac-toe A.I. can calculate the best moves using Minimax algorithm. Built in Python using Pygame library.
A simple chess game for comparing your moves with other chess engines
A game of checkers written using minmax algorithm and alpha-beta pruning.
2048 puzzle using minimax algorithm
AI based tic tac toe game that is impossible to win. Think you can beat a computer? Well, you can't.
Solutions to Pacman AI Multi-Agent Search problems
AI-Bot for Ultimate-Tic-Tac-Toe in Python
Contains my solution to selected projects in CS50AI
♘ Deep learning Chess Engine ♞
This project implemented the AI with Minimax Algorithm, Alpha-Beta Pruning and Iterative Deepening algorithms to play Sudo Isolation Game.
CSCI 561 - USC
A Connect 4 GUI with an AI opponent - using the Minimax algorithm with Alpha-Beta pruning
A simple Python implementation of align3 (you have to align 3 blobs together to win the game in upside-down gravity), vs a Minimax AI to play against a human. Uses tkinter for gui.
🎃 Unbeatable Tic Tac Toe Game using Minimax Algorithm.
Connect-4 game with a pygame UI, minimax AI and server-client mechanism using sockets.
Add a description, image, and links to the minimax-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the minimax-algorithm topic, visit your repo's landing page and select "manage topics."