Blunders Engine

Blunders Engine is the core library of the Blunders Chess Engine application.

Features

• Bitboard and mailbox representations for Chess Positions / Board state.
• Legal move generator.
• UCI communication facilities.
• A two-layer shared Transposition Table, that uses either a mutex lock or atomics for synchronization.
• Minimax with Alpha-Beta pruning based search, iterative deepening, quiescence search.
• Unified Error type.
• Incremental Zobrist hashing.
• Hand-crafted evaluation.
• Simple time management strategy.

Basic Usage

Blunders Engine can either be used by composing the raw components manually, or using the Engine API.

Search the start position to a depth of 4-ply using a Transposition Table with 10 megabytes of capacity: ```rust use blunders_engine::{search, Position, TranspositionTable};

let tt = TranspositionTable::withmb(10); let position = Position::startposition(); let ply = 4;

let searchresults = search::search(position, ply, &tt); println!("best move: {}, nodes/sec: {}", searchresults.bestmove, searchresults.nps()); asserteq!(searchresults.depth, ply); ```

Do the same as above with the engine API: ```rust use blunders_engine::{EngineBuilder, Position, Mode};

let ply = 4; let mut engine = EngineBuilder::new() .position(Position::startposition()) .transpositionsmb(10) .build();

let searchresults = engine.searchsync(Mode::depth(ply, None)); println!("best move: {}, nodes/sec: {}", searchresults.bestmove, searchresults.nps()); asserteq!(search_results.depth, ply); ```