♟️ 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 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
A functional chess game implemented in python, with pygame as a supporting graphics module.
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.
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."