C# chess library containing a complete data structure and move generation.
-
Updated
Jun 29, 2024 - C#
C# chess library containing a complete data structure and move generation.
Bitboard chess move generation based on magic bitboards
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.
Simple, well performed and enough optimized C#/.NET bitboard chess engine.
A local-first deterministic chess study, research, programming, data-generation, and publishing toolkit.
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
Pure Standard ML chess core: fully legal move generation, perft, FEN, UCI, and a negamax search (MLton + Poly/ML).
Distributed and collaborative perft system
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.
Original legal UCI chess engine (Rust): Podman CI, perft verification, Fastchess gauntlets, Lichess bot bridge.
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."