The mancala game consists of two-player, which is a turn-based strategy board games. There are two modes i) player vs player ii)AI Bot vs player. AI Bots works on Mini Max Algorithm

It's Tic-Tac-Toe Unbeatable A.I.

Implementation of Tic tac toe game using mini-max algorithm and alpha-beta pruning with JavaFX

Gomoku game integrating an AI player capable of beating a human player the fastest way possible. Implementing a min-max algorithm, trial and error to find the most adapted heuristics. This will not be as easy as checkers.

Tic Tac Toe game built with vanilla JS

Game Othelo (Reversi) made in WPF with several AI implementations

TicTacToe with mini max algorithm

I implemented a simple version of the Quoridor game which users can play against an AI designed using minimax and alpha-beta pruning algorithm.

Artificial Intelligence (COMP 424) Project

Droughts console game with Alpha-beta pruning as a modified version of the minimax algorithm

MiniMax-M3-Free — open-weight 428B MoE multimodal LLM. 1M-token context, native video understanding. 59% on SWE-bench Pro, rivals Claude & GPT-5.5 at 1/6th cost. MSA architecture. Self-host via Ollama, API on OpenRouter. Coding agents, agentic workflows & deployment guides included.

Tic-tac-toe is a game in which two players take turns in drawing either an ' O' or an ' X' in one square of a grid consisting of nine squares. The winner is the first player to get three squares of the same symbols in a row, column or diagonal. This C++ Code uses the MiniMax Algorithm to play as computer opponent.

Optimization of Connect4 Game using Mini-Max Algorithm and Alpha-Beta Pruning Algorithm.

Tic Tac Toe Game Using Mini Max Algorithm

Implementing the impossible to beat Tic-Tac-Toe game against an AI using ES6 and the Mini-Max algorithm.

Unbeatable (it cannot lose) tic-tac-toe player based on the minimax algorithm written in Prolog.