Title Page
Preface
About this book
About Rustic
Downloads
Prerequisites
1.
Introduction
❱
1.1.
Concept
1.2.
Design
1.3.
Roadmap
2.
Board Representation
❱
2.1.
Introduction
2.2.
Bitboards
2.3.
Reading FEN-strings
2.4.
Zobrist Hashing
2.5.
Game State
2.6.
Game History
2.7.
Detecting the bishop pair
2.8.
Detecting cannot force mate
2.9.
Detecting draws by FIDE rules
3.
Search
❱
3.1.
Introduction
3.2.
Move Ordering
❱
3.2.1.
The reason
3.2.2.
How it works
3.2.3.
MVV_LVA
3.2.4.
Killer moves heuristic
3.2.5.
TT-move ordering
4.
Evaluation
❱
4.1.
Understanding evaluation
4.2.
Material counting
4.3.
Piece-Square Tables
5.
Communication
❱
5.1.
Introduction
5.2.
Comparison
5.3.
How it works
5.4.
Design
5.5.
Implementing IComm
5.6.
Implementing commands
6.
Engine
❱
6.1.
Introduction
7.
Progress
❱
7.1.
Playing Strength
7.2.
SPRT testing
7.3.
SPRT results
7.4.
Changelog
8.
Appendix
❱
8.1.
The binary system
8.2.
Bitwise operations
9.
Ramblings
❱
9.1.
2023-03-14 - Picking up again
9.2.
2023-03-15 - A new computer
On idiomatic Rust
Building Rustic
FAQ
About me
Further study
Credits
Light (default)
Rust
Coal
Navy
Ayu
Creating the Rustic chess engine
Game State