There are 1 repository under minimax-alpha-beta-pruning topic.
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
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.
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)
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
A web-based implementation of connect four
Tic-Tac-Toe
Project I - HUST: Chess game with a Deep learning Bot trained on public data
A simple TicTacToe game with an unbeatable AI opponent using the MiniMax algorithm and alpha-beta pruning.
Chess game with an AI engine developed using the PyGame module
A Parallel AI Chess Game from Level 1 to Level 10 made with Java Swing
A Connect Four Solver with Minimax and Alpha-Beta Pruning
Python operations research applications including sudoku solver, tictactoe gaming AI
A simple AI for TicTacToe with Alpha-Beta pruning and binary encoding for the board
An unbeatable AI Tic Tac Toe game in C++, implementing the Minimax algorithm, optimized with Alpha-Beta pruning, and visualized tree traversal for each move.
Russian checkers on C# with mini-max and alpha-beta pruning
Tic-Tac-Toe game coded in Python using Minimax Algorithm
A UCI-compatible Chess Engine written in C++20 with an Android and WearOS Interface
2 player Connect4 implementation in C
🕹️👻👾👻 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.
My solutions to the Berkeley Pac-Man projects of spring 2022.
Desktop application developed using Scala and JavaFX SDK to play different games with an AI or your friend.
Chess Engine Developed With The MiniMax Algorithm
Final project for Data Estrucute Subject