TurboChess library

TurboChess is a fast move generator for chess that is situable for use in a chess engine. It supports:

• PEXT bitboards (emulated)
• Make and Undo Position
• Zobrist hashing
• FEN support

To get started, create a new Position and now you can work with legal moves

Example 1: Get the count of legal moves

```rs let pos: Position = Position::default(); // Loads the initial position // Or you can also use another position // let pos: Position = Position::from_str("r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 0 1").unwrap();

let legals: MoveList = pos.legal(); // Gets all legal moves in the position for mv in legals { println!("{mv}"); // Prints the move in the UCI format }

println!("Legal count: {}", legals.count()); ```

Example 2: Test all legal moves

rs let mut pos: Position = Position::default(); let legals: MoveList = pos.legal(); // Gets all legal moves in the position for mv in legals { pos.make_move(mv); println!("Doing stuff with move...") pos.undo_move(mv); } println!("Finished!")

Example 3: Play a random move

```rs let mut pos: Position = Position::default(); let legals: MoveList = pos.legal();

// Gets a random move let mut rng = rand::threadrng(); let index = rng.genrange(0..legals.count()); let mv = legals.get(index);

println!("Move: {mv}"); pos.make_move(mv); println!("{pos}"); println!("New FEN: {}", pos.fen()); ```

There is also a built in binary to run tests with TurboChess, such as perft, divide, complete perft and list.

Contribute to TurboChess

Actually, TurboChess probably has performance issues that can be fixed to be faster. There may be error in the code that can be fixed. If you find some of these errors, please raise an issue.