Chess representation written in Erlang using Bitboards, ready for use on game servers

C# chess library containing a complete data structure and move generation.

A C++ header-only library for efficient move generation in chess using "magic bitboards" technique

UCI chess engine written in Rust, the successor of Proxima b, Proxima b 2.0 and Cosette.

Python chess engine compiled with Numba (from 7300 to 1500000 nodes/second)

Just another chess engine on magic bitboards. Written in C++17.

Generator of magic numbers used in bitboard chess engines & move generators

A UCI Engine Developed from the ground up by Blake Johnson

A bitboard based chess program with parallel search and endgame table bases.

A C++ UCI-compliant chess engine.

The successor to the failed project sukless-chess

UCI Chess Engine / Move Generation / Gui

A rust library to manage uno-chess move generation

Implementation of magic bitboards to use in chess engines (with optimized functions for MSVC).

A competitive Java chess engine with bitboard representation, alpha-beta search, classical evaluation, and full UCI protocol support.

chess magic number search for quick sliding piece move generation

Chess rules implementation

Chess engine + Connect Four, Tic-Tac-Toe & AstroBots — written from scratch in C++ with Dear ImGui. Negamax/alpha-beta AI, magic bitboards, cross-platform (Windows/macOS/Linux), and playable in the browser via │ WebAssembly. No install needed.

Classic bit-boards VS Magic bit-board

This project leverages Magic Bitboards for highly efficient attack generation, implementing core functions essential for building a fast and optimized chess move generator and engine.