Chess Engine
This series of posts go through a high-level overview of how I programmed my chess engine, Otter.
My engine was written fully from scratch in Rust and implements many popular chess engine techniques and algorithms, detailed throughout these posts. The posts generally focus less on the exact code implemented and are more based in the theory of chess engines with some supplementary code snippets included.
If you'd instead like to see exactly how things are written, check out Otter's GitHub repository here!
1
Board Representation
Representing the board state using bitboards and FEN notation
2
Move Generation
Generating pseudo-legal and legal moves, along with making/unmaking them
3
Evaluation
Determining the strength of a position with material value, piece-square tables, and more
4
Tree Searching
Position tree searching using the alpha-beta algorithm, quiesence search, and move ordering
5
Transposition Table
Caching evaluations in transposition tables using Zobrist hashing