A C++ Chess Engine Finding Best Moves.
-
Updated
Dec 24, 2023 - C++
A C++ Chess Engine Finding Best Moves.
A multi-algorithm chess game that aims to teach AI concepts through experimentation. Users can select from four algorithms to compete against, as well set the search depth.
A Chess Engine Enhanced with Transposition Tables, Move Ordering, Null Move Pruning, Aspiration Window, Alpha-Beta Pruning, Quiescence Search, and Opening Books.
Chess Engine Implementation using Minmax, Alpha-Beta Pruning, and Quiescence Search Algorithm.
Chess AI built in Java, compatible with UCI.
A UCI-compatible Chess Engine written in C++20 with an Android and WearOS Interface
A UCI-compatible chess engine, capable of beating (most) human players.
A chess engine written in Java.
A python based chess engine
A Negamaxing Chess program in Java
Java chess AI using Principal Variation Splitting, Piece Square Tables, Opening Book and Tapered Evaluation.
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
Quiescence Search basierend auf einer einfachen Schach KI
♟️ An algorithmic chess engine, written in Python.
OBSIDIAN, a smart Python chess engine, plays strategically at a level of approximately 2000 ELO. uses Minimax Algorithm and Alpha-Beta Pruning
Chess made with Mithril JS
Optimised Alpha-Beta Chess Engine with quiescence search and time manager. Move generation is done using bitboards.
Bengal - A traditional chess engine written in python, play me on Lichess!
A chess game using AI-Minimax Algorithm with Alpha beta pruning
Add a description, image, and links to the quiescence-search topic page so that developers can more easily learn about it.
To associate your repository with the quiescence-search topic, visit your repo's landing page and select "manage topics."