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.

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.

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.

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

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

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

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

Ai agent for pacman

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

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

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.

A web-based implementation of connect four

Project 1

Tic-Tac-Toe

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

A Connect Four Solver with Minimax and Alpha-Beta Pruning

A simple AI for TicTacToe with Alpha-Beta pruning and binary encoding for the board