WIP Chess Engine

A C++ project in which you can play chess against an AI that uses alpha-beta pruning to predict the optimal move.

This project uses computer vision techniques to detect objects on a chessboard. The data are converted into an 8x8 numpy matrix which is passed to the minimax algorithm to suggest a move.

Minmax (minimax) algorithm with Alpha-Beta (𝛼−𝛽, ab) Pruning optimization for the Checkers (Draughts) game in Python 3. Same minimax algorithm works for chess, tic tac toe or similar games.

Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm

A LibGDX based Parallel AI Chess Game playable on many devices from Level 1 to Level 10

Bots for the board game quoridor implemented using four algorithms: minimax, minimax with alpha beta pruning, expectimax and monte carlo tree search.

Console version of the pen and paper game Obstruction with the Minimax algorithm.

Ai agent for pacman

A multi-algorithm chess game that aims to teach AI concepts through experimentation. Users can select from four algorithms to compete against, as well set the search depth.

An AI for a modified Reversi version. The AI works with a game server that manages the game (https://github.com/marcluque/Reversi-Server)

An unbeatable Tic-Tac-Toe Artificial Intelligence in C++, featuring the Minimax algorithm with Alpha-Beta pruning and visualized move tree traversal

MiniMax with Alpha-Beta pruning and Monte-Carlo Tree Search implementations for the board game Hex

Chess game with an AI engine developed using the PyGame module

A web-based implementation of connect four

Project I - HUST: Chess game with a Deep learning Bot trained on public data

Python operations research applications including sudoku solver, tictactoe gaming AI

A simple TicTacToe game with an unbeatable AI opponent using the MiniMax algorithm and alpha-beta pruning.

Russian checkers on C# with mini-max and alpha-beta pruning