perft

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

Perft debugger. Compare your chess engine's move generation to Stockfish

Bitboard chess move generation based on magic bitboards

a public distributed effort to traverse the depths of the game of chess.

Two player chess for the desktop, in Qt 6. Full FIDE rules, verified against published perft counts.

Single-purpose C++ perft engine tuned for speed: 2.4B positions/s on perft(7), single-threaded

Chess engine with UCI and Xboard interface

JavaScript chess move generator with strictly legal moves. Integrated check/checkmate/stalemate detection. Two implementations: x88 & Bitboards. Tactical analysis: captures, hanging pieces, safe squares. UCI engine. Perft validated. 7M NPS performance.

Quickly determine the number of positions at some depth in Tak.

Simple, well performed and enough optimized C#/.NET bitboard chess engine.

Chess engine built from scratch in C++17 using bitboards, alpha-beta pruning, and a Zobrist-hashed transposition table. Benchmarked against Stockfish

A local-first deterministic chess study, research, programming, data-generation, and publishing toolkit.

A four-player chess engine built to play the strongest 4PC it can. NNUE evaluation, an alpha-beta core in C and a Python root. Perft-verified move generation, all five starting setups, and a browser board to play against it. Plays Teams; FFA rules implemented, FFA search in progress.

The fastest chess engine and move generator in Rust (100% MIT). 540M nodes/s perft, PEXT / Fancy Magic bitboards, 16-bit binary replay, Shakmaty drop-in compat.

Chess move generator for Node.js and the browser: FEN in, every legal move out, in coordinate notation (e2e4). Bitboard-based, written in CoffeeScript and shipped as a single JavaScript file. Verified against a perft test suite. GPL-3.0.

A perft benchmarking tool.

Bitboard based fast legal move generator for standard 2 player chess.

ChessForge is a from-scratch Python chess engine and research platform with full rules, FEN, legal move generation, and deterministic alpha-beta search. It includes modern pruning, evaluation, and a benchmark-driven system for measuring and improving engine performance through reproducible experiments and testing.

Chess move generator in Erlang: reads a position in FEN and returns every legal move, or the position after a move. Verified against a perft test suite. GPL-3.0.

A custom made high-performance Chess Engine created entirely from scratch in modern C++, supporting UCI and terminal plays, O(1) memory hashing, and highly optimized game tree search algorithms along with Tapered evaluation leading to a signifcant rise in performance.