♟️ A chess engine with alpha-beta pruning, piece-square tables, move ordering, and command-line UI.

A chess engine enhanced with transposition tables, move ordering, null move pruning, aspiration window, alpha-beta pruning, quiescence search, and opening books.

Tic-Tac-Toe

A python based chess engine

A chess engine that implements a minimax algorithm, alpha-beta pruning, piece-square tables, move ordering, and a command-line UI

OBSIDIAN, a smart Python chess engine, plays strategically at a level of approximately 2000 ELO. uses Minimax Algorithm and Alpha-Beta Pruning

Jungle: Chess Game Engine - Implementation of Minimax, Alpha-Beta Pruning, Move Ordering, and Quiescence Search - SUSTech project of course CS109: Introduction to Programming in Spring 2023 - Score: 110/100

Rust implementation of a minimax algorithm. The game is a custom version of the Oware. Using Alphabeta pruning, move ordering, and a tiny iterative deepening.

A functional chess game implemented in python, with pygame as a supporting graphics module.

(chess, informal, derogatory) A bad player; an amateur.

This project presents an AI-driven Othello (Reversi) game designed to compare multiple algorithms, including Minimax, MCTS, A*, Q-Learning, and Negamax. It demonstrates various difficulty levels, which introduce controlled randomness to the AI for a more dynamic gameplay experience.

A tkinter program to run tic tac toe with a decent UI, which uses minimax with alpha beta pruning.

A Chess AI able to play at an ELO rating of 1300 points

Proiect Licenta Anul 3, Facultatea de Matematica si Informatica, Universitatea din Bucuresti