WIP Chess Engine
-
Updated
Sep 8, 2024 - Rust
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.
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
A Python implementation of the Gobblet game with an AI opponent using Minimax and Alpha-Beta Pruning
[Desktop Game] The term project for OOP. Compete against our Chinese dark chess engine, which using MiniMax algorithm.
Othello/Reversi Game in Python3, equipped with GUI + AI Player, made using pygame.
Bots for the board game quoridor implemented using four algorithms: minimax, minimax with alpha beta pruning, expectimax and monte carlo tree search.
Resources for the SOC project Queen's Gambit (IITB). Mentors: Aditya A, Aryan K, Kunal C
In this python game we play checkers against the computer.
Russian checkers on C# with mini-max and alpha-beta pruning
TicTacToe engine. Computer plays TicTacToe as X, player plays as O
An implementation of the "Othello-Reversi" game, we created during our third year at AUEB's Artificial Intelligence course.This impementation, uses the MiniMax algorithm with a-b pruning.For that reason, you can initialize the depth ot the algorithm, in order to make him more clever or dumber.
A simple and intuitive Chess AI in Python.
Two player checkers game for CS5346 Artificial Intelligence
Console version of the pen and paper game Obstruction with the Minimax algorithm.
simple bot for playing coganh
2 player Connect4 implementation in C
Add a description, image, and links to the minimax-alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the minimax-alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."