Bhess-Engine

Source code at Github

Current Development Status:

1. Bitboard [x]
2. Piece Masking [x]
3. Move Generation [x]
4. Magic Numbers [x]
5. Parsing FEN Strings [ ]
6. Perft Driver Functions [ ]
7. Evaluation [ ]
8. Quiescence Search [ ]

Bitboard:

• Why

  Bitboards are currently the fastest way for representing a board state. Since it only uses one instruction per operation on a 64-bit CPUs.

• Memory:

  The second reason to use BitBoards is that they are the most efficient way to store a board, which becomes relevant for the search in chess engines, since many boards are in memory during search.

• What is it anyway?