A Rust-based parser for board game data, designed for efficient data extraction and transformation.
The first compiled Unix shell — bytecode VM, worker pool, AOP intercept, Rkyv caching
A step based engine for the board game Arimaa.
A parser implementation for Poker Query Language (PQL)
Taikyoku Shogi engine — the largest known shogi variant (36x36 board, 804 pieces, 209 piece types)
A parser and writer for the fen4 file format used by Chess.com for 4 player chess games
A small example before developing computer chess and computer shogi. Come see the repository.
A rust library for parsing and handling FEN and algebraic chess notations.
WIP. Connect-four AI. Currently, does not work.
Prototype core poker library.
This is a fast chess move generator. It has a very good set of documentation, so you should take advantage of that. It (now) generates all lookup tables with a build.rs file, which means that very little pseudo-legal move generation requires branching. There are some convenience functions that are exposed to, for example, find all the squares between two squares. This uses a copy-on-make style structure, and the Board structure is as slimmed down as possible to reduce the cost of copying the board. There are places to improve perft-test performance further, but I instead opt to be more feature-complete to make it useful in real applications. For example, I generate both a hash of the board and a pawn-hash of the board for use in evaluation lookup tables (using Zobrist hashing). There are two ways to generate moves, one is faster, the other has more features that will be useful if making a chess engine. See the documentation for more details.
Field Expression Encoding Notation (FEEN): a compact, ASCII-only, no_std, zero-allocation validator and encoder for board-game positions in abstract strategy games, built on EPIN and SIN.