A checkers library with modern web GUI, Supprots multiple variants of game.

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

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

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

Tic Tac Toe game built with vanilla JS

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.

Artificial Intelligence (COMP 424) Project

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

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

TicTacToe with mini max algorithm

Tic Tac Toe using game theory

Four_In_A_Row problem has been solved using Python Language with the comprehensive implementation of Min-Max Alpha-Beta Pruning Algorithm. The Depth of the search for the algorithm has been customized for a quicker but less accurate response from an AI agent.

Unbeatable tic-tac-toe player based on the minimax algorithm written in Prolog.

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

AI playing connect 4 using heuristic mini-max with alpha beta pruning

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