Minimax is a AI algorithm.
-
Updated
Dec 27, 2023 - Python
Minimax is a AI algorithm.
Various C# implementations of game AI
CSE 571 Artificial Intelligence
A strong chess engine made in c++
A tic tac toe game with an AI opponent using minimax algorithm and alpha-beta pruning
A game of checkers written using minmax algorithm and alpha-beta pruning.
Artificial Intelligence for the game Go-Moku using the Minimax Algorithm with Alpha-Beta Pruning
A C++ project in which you can play chess against an AI that uses alpha-beta pruning to predict the optimal move.
My solved challenges and hacks (Go, Python, Java)
A repository containing codes and algorithms for the AI course 18CSC305J.
AI bots playing Tic Tac Toe
A simple chess game for comparing your moves with other chess engines
a basic adversarial game
A generic JAVA implementation of the Minimax algorithm (and derivated...)
A simple Tic Tac Toe game built using HTML, CSS, and JavaScript. This project allows players to enjoy the classic game in Player vs Player or Player vs AI mode.
2048 puzzle using minimax algorithm
Minor Project: The Chess is very well known in domain of Game AI. So is demonstrated using Minimax & Alpha-beta pruning algorithms
🎮 Unbeatable Tic-Tac-Toe game using React and Minimax algorithm.
🎮 使用α-β剪枝(Alpha-beta-pruning)的极小极大算法(Minimax-algorithm)实现的井字棋(一字棋、tic-tac-toe)游戏。
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."