Minimax is a AI algorithm.
Complete TypeScript chess engine with zero dependencies for Node.js >=24 and browsers. Features configurable AI (5 predefined difficulty levels), stateful/stateless APIs, and supports JSON and FEN formats.
Various C# implementations of game AI
A tic tac toe game with an AI opponent using minimax algorithm and alpha-beta pruning
A top superhuman chess engine made in c++
Minimax AI Strategy Engine for Valvo Board Game in Rust 2026
CSE 571 Artificial Intelligence
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.
🎮 使用α-β剪枝（Alpha-beta-pruning）的极小极大算法（Minimax-algorithm）实现的井字棋（一字棋、tic-tac-toe）游戏。
A browser-native Tic-Tac-Toe game with configurable minimax AI, local statistics, replay sharing, themes, and responsive UI.
A simple chess game for comparing your moves with other chess engines
A set of AIs for the 2048 tile-merging game. Includes an expectimax strategy that reaches 16384 with 34.6% success and an ML model trained with temporal difference learning.
A full featured chess engine designed to fit in an embedded environment, using less than 2K of RAM!
My solved challenges and hacks (Go, Python, Java)
AI bots playing Tic Tac Toe
Minor Project: The Chess is very well known in domain of Game AI. So is demonstrated using Minimax & Alpha-beta pruning algorithms
a basic adversarial game
A repository containing codes and algorithms for the AI course 18CSC305J.
To associate your repository with the minimax-algorithm topic, visit your repo's landing page and select "manage topics."