1.
What is this?
2.
What is Chess?
2.1.
How do the pieces move?
Methods
3.
Board Representation
3.1.
Bitboard Representation
4.
Overview of Methods Used
4.1.
Lookup Tables
4.2.
Hashing Algorithms
4.3.
Calculating on the fly
Layout
5.
Square struct
6.
Move struct
7.
MoveType enum
8.
PieceSet struct
9.
Piece enum
10.
Board struct
Move Generation
11.
Knight Moves
12.
(Basic) King Moves
13.
(Basic) Pawn Moves
14.
Sliding Piece Moves
14.1.
Magic Bitboards
14.2.
Bishop Moves
14.3.
Rook Moves
14.4.
Queen Moves
Additional Behaviours
15.
For the King
15.1.
Castling
15.2.
Checks
15.3.
Pinned Pieces
16.
For the Pawns
16.1.
Promotions
16.2.
En-Passant
Outside the Pieces
17.
Half-move Clock
18.
Checkmates
19.
Draw Rules
19.1.
Fifty-move Rule
19.2.
Insufficient Material
19.3.
Three-fold Repetition
Zobrist Hashing
20.
Storing Chess Boards
20.1.
Explanation of Zobrist Hashing
20.2.
Implementation of Zobrist Hashing
20.3.
Linking to Three-fold Repetition
Perft Testing
21.
What is Perft?
22.
Implementing Perft
23.
Comparing Perft Results
Going Further
24.
Chess960 Support
24.1.
How Castling Works
24.2.
Implementing Castling
24.3.
Adding FEN Support
25.
PGN Support
26.
Conclusion
27.
Contributors
Light
Rust
Coal
Navy
Ayu
Bitboard Representation
This section is under construction... ⚠️