projects/chess
1
0
Fork 0
Code Issues 9 Pull Requests Actions Packages Projects Releases Wiki Activity

Add Pseudo Move Generator (#12)
All checks were successful
Python tests (make) / test (push) Successful in 11s
Details

Browse Source 
work on #7

Reviewed-on: #12
Co-authored-by: Josh <josh@joshuaschuett.com>
Co-committed-by: Josh <josh@joshuaschuett.com>
This commit is contained in:
Josh
2025-08-18 00:28:00 +00:00
committed by Josh
parent c02ec7875d
commit 1db90828ac
9 changed files with 1140 additions and 162 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
engine/include/bitboard.h
View File

@@ -25,6 +25,39 @@
#define GET_BIT(bb, sq) ((bb) & (1ULL << (sq)))
#define TOGGLE_BIT(bb, sq) ((bb) ^= (1ULL << (sq)))
// King castling helpers.
#define BB(sq) (1ULL << (sq))
// a1 = 0, h8 = 63 (rank*8 + file)
enum Square {
A1,B1,C1,D1,E1,F1,G1,H1,
A2,B2,C2,D2,E2,F2,G2,H2,
A3,B3,C3,D3,E3,F3,G3,H3,
A4,B4,C4,D4,E4,F4,G4,H4,
A5,B5,C5,D5,E5,F5,G5,H5,
A6,B6,C6,D6,E6,F6,G6,H6,
A7,B7,C7,D7,E7,F7,G7,H7,
A8,B8,C8,D8,E8,F8,G8,H8
};
#define WK_EMPTY_MASK (BB(F1) | BB(G1))
#define WQ_EMPTY_MASK (BB(B1) | BB(C1) | BB(D1))
#define BK_EMPTY_MASK (BB(F8) | BB(G8))
#define BQ_EMPTY_MASK (BB(B8) | BB(C8) | BB(D8))
// squares king is on / passes / lands (use for attacked-squares test later)
#define WK_THRU_MASK (BB(E1) | BB(F1) | BB(G1))
#define WQ_THRU_MASK (BB(E1) | BB(D1) | BB(C1))
#define BK_THRU_MASK (BB(E8) | BB(F8) | BB(G8))
#define BQ_THRU_MASK (BB(E8) | BB(D8) | BB(C8))
// king target squares
#define WK_TO G1
#define WQ_TO C1
#define BK_TO G8
#define BQ_TO C8
enum Color { WHITE = 0, BLACK = 1, BOTH = 2 };
enum Piece {
P, N, B, R, Q, K, // 0..5 white
@@ -38,6 +71,23 @@ enum Castling {
CASTLE_BQ = 1 << 3
};
enum MoveFlags {
MF_NONE = 0,
MF_CAPTURE = 1 << 0,
MF_PROMO = 1 << 1,
MF_ENPASSANT = 1 << 2,
MF_CASTLE = 1 << 3,
MF_DOUBLE_PUSH = 1 << 4,
};
struct Move {
uint16_t from;
uint16_t to;
uint8_t piece;
uint8_t promo;
uint8_t flags;
};
struct Board {
uint64_t pieces[12]; // Each set of pieces get a bitboard for each player.
uint64_t occ[3]; // Color occupancy bitboards.
@@ -55,4 +105,13 @@ struct Board {
void create_knight_attack_cache();
void create_pawn_attack_cache();
void create_king_attack_cache();
void print_board();
void print_board();
void gen_white_pawn_quiet_pushes(const struct Board *board, struct Move *moves, int *count);
void gen_black_pawn_quiet_pushes(const struct Board *board, struct Move *moves, int *count);
void gen_white_pawn_push_promotions(const struct Board *board, struct Move *moves, int *count);
void gen_black_pawn_push_promotions(const struct Board *board, struct Move *moves, int *count);
void gen_white_pawn_captures(const struct Board *board, struct Move *moves, int *count);
void gen_black_pawn_captures(const struct Board *board, struct Move *moves, int *count);
void gen_white_pawn_capture_promotions(const struct Board *board, struct Move *moves, int *count);
void gen_black_pawn_capture_promotions(const struct Board *board, struct Move *moves, int *count);
int gen_pseudo_moves(const struct Board *board, struct Move *out, bool captures_only);