C# chess library containing a complete data structure and move generation.
Bitboard chess move generation based on magic bitboards
Two player chess for the desktop, in Qt 6. Full FIDE rules, verified against published perft counts.
a public distributed effort to traverse the depths of the game of chess.
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.
A local-first deterministic chess study, research, programming, data-generation, and publishing toolkit.
Simple, well performed and enough optimized C#/.NET bitboard chess engine.
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.
Chess engine written from scratch in C with legal move generation, FEN/SAN parsing, reversible make/unmake moves, perft tests and negamax search
Chess Engine in C
High-performance C++20 bitboard chess base and move generation library and perft engine with exact legal move generation, reaching 500M+ nodes/s.
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.
ChessMG — chess move generation at engine speed, with Python comfort.
Pure Standard ML chess core: fully legal move generation, perft, FEN, UCI, and a negamax search (MLton + Poly/ML).
Add a description, image, and links to the perft topic page so that developers can more easily learn about it.
To associate your repository with the perft topic, visit your repo's landing page and select "manage topics."