♟️ A chess engine with alpha-beta pruning, piece-square tables, move ordering, and command-line UI.
-
Updated
Mar 24, 2023 - Python
♟️ 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
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.
Jungle: Chess Game Engine - Implementation of Minimax, Alpha-Beta Pruning, Move Ordering, and Quiescence Search - SUSTech's project of course CS109: Introduction to Programming in Spring 2023 - Score: 110/100
Proiect Licenta Anul 3, Facultatea de Matematica si Informatica, Universitatea din Bucuresti
A Chess AI able to play at an ELO rating of 1300 points
Add a description, image, and links to the move-ordering topic page so that developers can more easily learn about it.
To associate your repository with the move-ordering topic, visit your repo's landing page and select "manage topics."