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

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

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.

Resources for the SOC project Queen's Gambit (IITB). Mentors: Aditya A, Aryan K, Kunal C

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

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

Chess game with an AI engine developed using the PyGame module

Tic-Tac-Toe game coded in Python using Minimax Algorithm

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

My solutions to the Berkeley Pac-Man projects of spring 2022.

🕹️👻👾👻 In this thrilling AI adventure, we embark on a multi-stage quest to transform Pacman into an intelligent game-playing agent. Across three engaging projects, we explore various facets of artificial intelligence, from basic search algorithms to adversarial competition and reinforcement learning.

A full game engine with GUI developed using minimax and alpha beta pruning algorithms.

Strong AI for Chess Games

A snake Ai(Orion's Fang) created for the 2023 RBC spring BattleSnake competition

Chess Game with AI employing MiniMax with Alpha-Beta pruning utilizing moves predicted by Convolutional Neural Network

Othello/Reversi Game in Python3, equipped with GUI + AI Player, made using pygame.

This program uses the minimax algorithm with alpha-beta pruning to reduce the search space.