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 tic tac toe game with an AI opponent using minimax algorithm and alpha-beta pruning
A simple chess game for comparing your moves with other chess engines
Various C# implementations of game AI
Minimax algorithm for a Tic Tac Toe for Python Jupyter Notebook
A game of checkers written using minmax algorithm and alpha-beta pruning.
A repository containing codes and algorithms for the AI course 18CSC305J.
Artificial Intelligence for the game Go-Moku using the Minimax Algorithm with Alpha-Beta Pruning
Web chess game with AI chess bot (minimax algorithm).♟
🎮 Unbeatable Tic-Tac-Toe game using React and Minimax algorithm.
Minimax based Chess engine. Kinda works lol.
My solved challenges and hacks (Go, Python, Java)
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.
The board game Reversi/Othello written in C# and XAML. Features modern UI and a simple minimax/alpha beta pruning AI.
A C++ project in which you can play chess against an AI that uses alpha-beta pruning to predict the optimal move.
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."