minimax algorithm for chess with alpha-beta pruning
-
Updated
Aug 23, 2022 - Jupyter Notebook
minimax algorithm for chess with alpha-beta pruning
Lichess BOT engine
A chess game in java, allowing to play against an ai opponent.
A simple 2D chess engine built in Unity C# from scratch.
A full-featured Python Chess game with GUI built using Tkinter, featuring a Minimax AI opponent with alpha-beta pruning, threaded AI computation, move validation, check/checkmate detection, and player timers.
A chess-playing AI using minimax algorithm with alpha-beta pruning for move generation. (School Project - 2017)
This project is an implementation of Suicide Chess, a variation of standard chess, using the Minimax algorithm enhanced with Alpha-Beta pruning. It simulates a two-player game where the objective is to lose all pieces, and evaluates multiple future moves to determine the most strategic sacrifices according to the rules of this variant.
To associate your repository with the minimax-chess topic, visit your repo's landing page and select "manage topics."