stellar

UCI Chess engine written in C++20

git clone git://git.dimitrijedobrota.com/stellar.git

commit	bb400a401c05a3cdd711086350996316a3a428ba
parent	9a599121be77a675f1ff1a1b9254ca2efe143f58
author	Dimitrije Dobrota <mail@dimitrijedobrota.com>
date	Sat, 29 Jul 2023 21:40:29 +0200

Split Attacks into multiple files

Diffstat:

M	CMakeLists.txt	\|	+-
M	src/attacks/CMakeLists.txt	\|	++++++++++++++++++++++++++++
M	src/attacks/attacks.c	\|	++++++++++++++--------------------------------------------------------------------
A	src/attacks/internal.c	\|	+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
A	src/attacks/internal.h	\|	+++++++++++++++++++++++++++++++
A	src/attacks/magic.c	\|	+++++++++++++++++++++++++++++++++++++++++++++++++++
A	src/attacks/magic.h	\|	+++++++++
A	src/attacks/magic_generate.c	\|	+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

8 files changed, 412 insertions(+), 338 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt

@@ -3,7 +3,7 @@ set(CMAKE_EXPORT_COMPILE_COMMANDS ON)

project(

Stellar

VERSION 0.0.3

VERSION 0.0.4

DESCRIPTION "Chess engine written in C"

HOMEPAGE_URL https://git.dimitrijedobrota.com/stellar.git

LANGUAGES C

diff --git a/src/attacks/CMakeLists.txt b/src/attacks/CMakeLists.txt

@@ -1,7 +1,35 @@

add_library(attacks OBJECT

attacks.c

internal.c

magic.c

)

target_include_directories(attacks

PUBLIC "${PROJECT_SOURCE_DIR}/src/include"

PRIVATE "internal"

)

project(

MagicGenerator

VERSION 1.0.0

DESCRIPTION "Generator of magic numbers for bishup and rook attacks"

LANGUAGES C

)

add_executable(magic

internal.c

magic.c

magic_generate.c

)

target_link_libraries(magic

PRIVATE utils

)

set_target_properties(magic PROPERTIES

VERSION ${PROJECT_VERSION}

SOVERSION ${PROJECT_VERSION_MAJOR}

RUNTIME_OUTPUT_DIRECTORY "${CMAKE_BINARY_DIR}/bin"

)

diff --git a/src/attacks/attacks.c b/src/attacks/attacks.c

@@ -1,367 +1,93 @@

#include "attacks.h"

#include "piece.h" // BLACK, WHITE

#include <string.h>

#include "internal.h"

#include "magic.h"

#define UNUSED(x) (void)(x)

// Magic constants

// clang-format off

const int bishop_relevant_bits[64] = {

6, 5, 5, 5, 5, 5, 5, 6,

5, 5, 5, 5, 5, 5, 5, 5,

5, 5, 7, 7, 7, 7, 5, 5,

5, 5, 7, 9, 9, 7, 5, 5,

5, 5, 7, 7, 7, 7, 5, 5,

5, 5, 5, 5, 5, 5, 5, 5,

6, 5, 5, 5, 5, 5, 5, 6,

};

const U64 bishop_magic_numbers[64] = {

C64(0x40040844404084), C64(0x2004208a004208), C64(0x10190041080202),

C64(0x108060845042010), C64(0x581104180800210), C64(0x2112080446200010),

C64(0x1080820820060210), C64(0x3c0808410220200), C64(0x4050404440404),

C64(0x21001420088), C64(0x24d0080801082102), C64(0x1020a0a020400),

C64(0x40308200402), C64(0x4011002100800), C64(0x401484104104005),

C64(0x801010402020200), C64(0x400210c3880100), C64(0x404022024108200),

C64(0x810018200204102), C64(0x4002801a02003), C64(0x85040820080400),

C64(0x810102c808880400), C64(0xe900410884800), C64(0x8002020480840102),

C64(0x220200865090201), C64(0x2010100a02021202), C64(0x152048408022401),

C64(0x20080002081110), C64(0x4001001021004000), C64(0x800040400a011002),

C64(0xe4004081011002), C64(0x1c004001012080), C64(0x8004200962a00220),

C64(0x8422100208500202), C64(0x2000402200300c08), C64(0x8646020080080080),

C64(0x80020a0200100808), C64(0x2010004880111000), C64(0x623000a080011400),

C64(0x42008c0340209202), C64(0x209188240001000), C64(0x400408a884001800),

C64(0x110400a6080400), C64(0x1840060a44020800), C64(0x90080104000041),

C64(0x201011000808101), C64(0x1a2208080504f080), C64(0x8012020600211212),

C64(0x500861011240000), C64(0x180806108200800), C64(0x4000020e01040044),

C64(0x300000261044000a), C64(0x802241102020002), C64(0x20906061210001),

C64(0x5a84841004010310), C64(0x4010801011c04), C64(0xa010109502200),

C64(0x4a02012000), C64(0x500201010098b028), C64(0x8040002811040900),

C64(0x28000010020204), C64(0x6000020202d0240), C64(0x8918844842082200),

C64(0x4010011029020020),

};

const int rook_relevant_bits[64] = {

12, 11, 11, 11, 11, 11, 11, 12,

11, 10, 10, 10, 10, 10, 10, 11,

12, 11, 11, 11, 11, 11, 11, 12,

};

const U64 rook_magic_numbers[64] = {

C64(0x8a80104000800020), C64(0x140002000100040), C64(0x2801880a0017001),

C64(0x100081001000420), C64(0x200020010080420), C64(0x3001c0002010008),

C64(0x8480008002000100), C64(0x2080088004402900), C64(0x800098204000),

C64(0x2024401000200040), C64(0x100802000801000), C64(0x120800800801000),

C64(0x208808088000400), C64(0x2802200800400), C64(0x2200800100020080),

C64(0x801000060821100), C64(0x80044006422000), C64(0x100808020004000),

C64(0x12108a0010204200), C64(0x140848010000802), C64(0x481828014002800),

C64(0x8094004002004100), C64(0x4010040010010802), C64(0x20008806104),

C64(0x100400080208000), C64(0x2040002120081000), C64(0x21200680100081),

C64(0x20100080080080), C64(0x2000a00200410), C64(0x20080800400),

C64(0x80088400100102), C64(0x80004600042881), C64(0x4040008040800020),

C64(0x440003000200801), C64(0x4200011004500), C64(0x188020010100100),

C64(0x14800401802800), C64(0x2080040080800200), C64(0x124080204001001),

C64(0x200046502000484), C64(0x480400080088020), C64(0x1000422010034000),

C64(0x30200100110040), C64(0x100021010009), C64(0x2002080100110004),

C64(0x202008004008002), C64(0x20020004010100), C64(0x2048440040820001),

C64(0x101002200408200), C64(0x40802000401080), C64(0x4008142004410100),

C64(0x2060820c0120200), C64(0x1001004080100), C64(0x20c020080040080),

C64(0x2935610830022400), C64(0x44440041009200), C64(0x280001040802101),

C64(0x2100190040002085), C64(0x80c0084100102001), C64(0x4024081001000421),

C64(0x20030a0244872), C64(0x12001008414402), C64(0x2006104900a0804),

C64(0x1004081002402),

};

// Utility functions

int hash(U64 key, U64 magic, int relevant_bits) {

return (key * magic) >> (64 - relevant_bits);

U64 attacks_wpawn_get(Square square, U64 occupancy) {

UNUSED(occupancy);

return pawn_attacks[WHITE][square];

}

// pseudo random numbers

U32 state = C32(1804289383);

U32 get_random_U32_number() {

U32 number = state;

number ^= number << 13;

number ^= number >> 17;

number ^= number << 5;

return state = number;

U64 attacks_bpawn_get(Square square, U64 occupancy) {

UNUSED(occupancy);

return pawn_attacks[BLACK][square];

}

U64 get_random_U64_number() {

U64 n1, n2, n3, n4;

n1 = (U64)(get_random_U32_number()) & C64(0xFFFF);

n2 = (U64)(get_random_U32_number()) & C64(0xFFFF);

n3 = (U64)(get_random_U32_number()) & C64(0xFFFF);

n4 = (U64)(get_random_U32_number()) & C64(0xFFFF);

return n1 | (n2 << 16) | (n3 << 32) | (n4 << 48);

U64 attacks_knight_get(Square square, U64 occupancy) {

UNUSED(occupancy);

return knight_attacks[square];

}

// pawn attack table [side][square]

U64 attacks_pawn[2][64];

// knight attack table [square]

U64 attacks_knight[64];

// king attack table [square]

U64 attacks_king[64];

// bishop attack mask

U64 attakcs_bishop_masks[64];

// rook attack mask

U64 attacks_rook_masks[64];

// bishop attack table [square][occupancies]

U64 attacks_bishop[64][512]; // 256 K

// rook attack table [square][occupancies]

U64 attacks_rook[64][4096]; // 2048K

U64 attacks_wpawn_get(Square square, U64 occupancy){

UNUSED(occupancy);

return attacks_pawn[WHITE][square];

U64 attakcs_king_get(Square square, U64 occupancy) {

UNUSED(occupancy);

return king_attacks[square];

}

U64 attacks_bpawn_get(Square square, U64 occupancy){

UNUSED(occupancy);

return attacks_pawn[BLACK][square];

U64 attacks_bishop_get(Square square, U64 occupancy) {

occupancy &= bishop_masks[square];

occupancy = hash(occupancy, bishop_magic_numbers[square],

bishop_relevant_bits[square]);

return bishop_attacks[square][occupancy];

}

U64 attacks_knight_get(Square square, U64 occupancy){

UNUSED(occupancy);

return attacks_knight[square];

U64 attacks_rook_get(Square square, U64 occupancy) {

occupancy &= rook_masks[square];

occupancy =

hash(occupancy, rook_magic_numbers[square], rook_relevant_bits[square]);

return rook_attacks[square][occupancy];

}

U64 attakcs_king_get(Square square, U64 occupancy){

UNUSED(occupancy);

return attacks_king[square];

}

U64 attacks_bishop_get(Square square, U64 occupancy){

occupancy &= attakcs_bishop_masks[square];

occupancy = hash(occupancy, bishop_magic_numbers[square],

bishop_relevant_bits[square]);

return attacks_bishop[square][occupancy];

}

U64 attacks_rook_get(Square square, U64 occupancy){

occupancy &= attacks_rook_masks[square];

occupancy =

hash(occupancy, rook_magic_numbers[square], rook_relevant_bits[square]);

return attacks_rook[square][occupancy];

}

U64 attacks_queen_get(Square square, U64 occupancy){

return (attacks_bishop_get(square, occupancy) |

attacks_rook_get(square, occupancy));

}

// generate pawn attack

U64 attacks_pawn_mask(int side, Square square) {

U64 bitboard = C64(0);

bit_set(bitboard, square);

if (side == WHITE)

return noWeOne(bitboard) | noEaOne(bitboard);

else

return soWeOne(bitboard) | soEaOne(bitboard);

}

U64 attacks_knight_mask(Square square) {

U64 bitboard = C64(0), attacks = C64(0), tmp;

bit_set(bitboard, square);

tmp = nortOne(nortOne(bitboard));

attacks |= westOne(tmp) | eastOne(tmp);

tmp = soutOne(soutOne(bitboard));

attacks |= westOne(tmp) | eastOne(tmp);

tmp = westOne(westOne(bitboard));

attacks |= soutOne(tmp) | nortOne(tmp);

tmp = eastOne(eastOne(bitboard));

attacks |= soutOne(tmp) | nortOne(tmp);

return attacks;

}

U64 attacks_king_mask(Square square) {

U64 bitboard = C64(0), attacks = C64(0);

bit_set(bitboard, square);

attacks |= westOne(bitboard) | eastOne(bitboard);

attacks |= soutOne(bitboard) | nortOne(bitboard);

attacks |= soEaOne(bitboard) | noEaOne(bitboard);

attacks |= soWeOne(bitboard) | noWeOne(bitboard);

return attacks;

}

U64 attacks_slide_mask(Square square, U64 block, const direction_f dir[4],

int len[4]) {

U64 bitboard = C64(0), attacks = C64(0), tmp;

int i, j;

bit_set(bitboard, square);

for (i = 0; i < 4; i++) {

for (j = 0, tmp = bitboard; j < len[i]; j++) {

attacks |= tmp = (dir[i])(tmp);

if (tmp & block)

break;

}

return attacks;

}

const direction_f attacks_bishop_direction[4] = { noEaOne, noWeOne, soEaOne, soWeOne };

const direction_f attacks_rook_direction[4] = { westOne, soutOne, eastOne, nortOne };

U64 attacks_bishop_mask(Square square) {

int tr = square / 8, tf = square % 8;

int len[4] = {MIN(7 - tf, 7 - tr) - 1, MIN(tf, 7 - tr) - 1,

MIN(7 - tf, tr) - 1, MIN(tf, tr) - 1};

return attacks_slide_mask(square, C64(0), attacks_bishop_direction, len);

}

U64 attacks_rook_mask(Square square) {

int tr = square / 8, tf = square % 8;

int len[4] = {tf - 1, tr - 1, 6 - tf, 6 - tr};

return attacks_slide_mask(square, C64(0), attacks_rook_direction, len);

}

U64 attacks_bishop_on_the_fly(Square square, U64 block) {

int tr = square / 8, tf = square % 8;

int len[4] = {MIN(7 - tf, 7 - tr), MIN(tf, 7 - tr), MIN(7 - tf, tr),

MIN(tf, tr)};

return attacks_slide_mask(square, block, attacks_bishop_direction, len);

}

U64 attacks_rook_on_the_fly(Square square, U64 block) {

int tr = square / 8, tf = square % 8;

int len[4] = {tf, tr, 7 - tf, 7 - tr};

return attacks_slide_mask(square, block, attacks_rook_direction, len);

U64 attacks_queen_get(Square square, U64 occupancy) {

return (attacks_bishop_get(square, occupancy) |

attacks_rook_get(square, occupancy));

}

void attacks_init_leapers(void) {

for (Square square = 0; square < 64; square++) {

attacks_pawn[WHITE][square] = attacks_pawn_mask(WHITE, square);

attacks_pawn[BLACK][square] = attacks_pawn_mask(BLACK, square);

attacks_knight[square] = attacks_knight_mask(square);

attacks_king[square] = attacks_king_mask(square);

}

U64 set_occupancy(int index, int bits_in_mask, U64 attack_mask) {

U64 occupancy = C64(0);

for (int count = 0; count < bits_in_mask; count++) {

Square square = bit_lsb_index(attack_mask);

bit_pop(attack_mask, square);

if (index & (1 << count))

bit_set(occupancy, square);

}

return occupancy;

for (Square square = 0; square < 64; square++) {

pawn_attacks[WHITE][square] = pawn_mask(WHITE, square);

pawn_attacks[BLACK][square] = pawn_mask(BLACK, square);

knight_attacks[square] = knight_mask(square);

king_attacks[square] = king_mask(square);

}

void attacks_init_sliders(int bishop) {

for (Square square = 0; square < 64; square++) {

U64 attack_mask;

if (bishop) {

attakcs_bishop_masks[square] = attacks_bishop_mask(square);

attack_mask = attakcs_bishop_masks[square];

} else {

attacks_rook_masks[square] = attacks_rook_mask(square);

attack_mask = attacks_rook_masks[square];

}

int relevant_bits = bit_count(attack_mask);

int occupancy_indicies = 1 << relevant_bits;

for (int index = 0; index < occupancy_indicies; index++) {

U64 occupancy = set_occupancy(index, relevant_bits, attack_mask);

if (bishop) {

int magic_index = (occupancy * bishop_magic_numbers[square]) >>

(64 - bishop_relevant_bits[square]);

attacks_bishop[square][magic_index] =

attacks_bishop_on_the_fly(square, occupancy);

} else {

int magic_index = hash(occupancy, rook_magic_numbers[square],

rook_relevant_bits[square]);

attacks_rook[square][magic_index] =

attacks_rook_on_the_fly(square, occupancy);

}

for (Square square = 0; square < 64; square++) {

U64 attack_mask;

if (bishop) {

bishop_masks[square] = bishop_mask(square);

attack_mask = bishop_masks[square];

} else {

rook_masks[square] = rook_mask(square);

attack_mask = rook_masks[square];

}

int relevant_bits = bit_count(attack_mask);

int occupancy_indicies = 1 << relevant_bits;

for (int index = 0; index < occupancy_indicies; index++) {

U64 occupancy = set_occupancy(index, relevant_bits, attack_mask);

if (bishop) {

int magic_index = (occupancy * bishop_magic_numbers[square]) >>

(64 - bishop_relevant_bits[square]);

bishop_attacks[square][magic_index] =

bishop_on_the_fly(square, occupancy);

} else {

int magic_index = hash(occupancy, rook_magic_numbers[square],

rook_relevant_bits[square]);

rook_attacks[square][magic_index] =

rook_on_the_fly(square, occupancy);

}

void attacks_init(void) {

attacks_init_leapers();

attacks_init_sliders(WHITE);

attacks_init_sliders(BLACK);

}

// magic numbers

U64 generate_magic_number() {

return get_random_U64_number() & get_random_U64_number() &

get_random_U64_number();

}

U64 find_magic_number(Square square, int relevant_bits, int bishop) {

U64 occupancies[4096], attacks[4096], used_attacks[4096];

U64 attack_mask =

bishop ? attacks_bishop_mask(square) : attacks_rook_mask(square);

int occupancy_indicies = 1 << relevant_bits;

for (int index = 0; index < occupancy_indicies; index++) {

occupancies[index] = set_occupancy(index, relevant_bits, attack_mask);

attacks[index] = bishop

? attacks_bishop_on_the_fly(square, occupancies[index])

: attacks_rook_on_the_fly(square, occupancies[index]);

}

for (int random_count = 0; random_count < 100000000; random_count++) {

U64 magic_number = generate_magic_number();

if (bit_count((attack_mask * magic_number) & C64(0xFF00000000000000)) < 6)

continue;

memset(used_attacks, C64(0), sizeof(used_attacks));

int index, fail;

for (index = 0, fail = 0; !fail && index < occupancy_indicies; index++) {

int magic_index = hash(occupancies[index], magic_number, relevant_bits);

if (used_attacks[magic_index] == C64(0))

used_attacks[magic_index] = attacks[index];

else if (used_attacks[magic_index] != attacks[index])

fail = 1;

}

if (!fail)

return magic_number;

}

return C64(0);

attacks_init_sliders(0);

attacks_init_sliders(1);

}

diff --git a/src/attacks/internal.c b/src/attacks/internal.c

@@ -0,0 +1,141 @@

#include "internal.h"

U64 king_attacks[64];

U64 knight_attacks[64];

U64 pawn_attacks[2][64];

U64 rook_attacks[64][4096]; // 2048K

U64 bishop_attacks[64][512]; // 256 K

U64 rook_masks[64];

U64 bishop_masks[64];

// clang-format off

const int bishop_relevant_bits[64] = {

6, 5, 5, 5, 5, 5, 5, 6,

5, 5, 5, 5, 5, 5, 5, 5,

5, 5, 7, 7, 7, 7, 5, 5,

5, 5, 7, 9, 9, 7, 5, 5,

5, 5, 7, 7, 7, 7, 5, 5,

5, 5, 5, 5, 5, 5, 5, 5,

6, 5, 5, 5, 5, 5, 5, 6,

};

const int rook_relevant_bits[64] = {

12, 11, 11, 11, 11, 11, 11, 12,

11, 10, 10, 10, 10, 10, 10, 11,

12, 11, 11, 11, 11, 11, 11, 12,

};

// clang-format on

int hash(U64 key, U64 magic, int relevant_bits) {

return (key * magic) >> (64 - relevant_bits);

}

U64 set_occupancy(int index, int bits_in_mask, U64 attack_mask) {

U64 occupancy = C64(0);

for (int count = 0; count < bits_in_mask; count++) {

Square square = bit_lsb_index(attack_mask);

bit_pop(attack_mask, square);

if (index & (1 << count)) bit_set(occupancy, square);

}

return occupancy;

}

U64 attacks_slide_mask(Square square, U64 block, const direction_f dir[4],

int len[4]) {

U64 bitboard = C64(0), attacks = C64(0), tmp;

int i, j;

bit_set(bitboard, square);

for (i = 0; i < 4; i++) {

for (j = 0, tmp = bitboard; j < len[i]; j++) {

attacks |= tmp = (dir[i])(tmp);

if (tmp & block) break;

}

return attacks;

}

// Mask Attacks

const direction_f attacks_bishop_direction[4] = {noEaOne, noWeOne, soEaOne,

soWeOne};

const direction_f attacks_rook_direction[4] = {westOne, soutOne, eastOne,

nortOne};

U64 pawn_mask(int side, Square square) {

U64 bitboard = C64(0);

bit_set(bitboard, square);

if (side == WHITE)

return noWeOne(bitboard) | noEaOne(bitboard);

else

return soWeOne(bitboard) | soEaOne(bitboard);

}

U64 knight_mask(Square square) {

U64 bitboard = C64(0), attacks = C64(0), tmp;

bit_set(bitboard, square);

tmp = nortOne(nortOne(bitboard));

attacks |= westOne(tmp) | eastOne(tmp);

tmp = soutOne(soutOne(bitboard));

attacks |= westOne(tmp) | eastOne(tmp);

tmp = westOne(westOne(bitboard));

attacks |= soutOne(tmp) | nortOne(tmp);

tmp = eastOne(eastOne(bitboard));

attacks |= soutOne(tmp) | nortOne(tmp);

return attacks;

}

U64 king_mask(Square square) {

U64 bitboard = C64(0), attacks = C64(0);

bit_set(bitboard, square);

attacks |= westOne(bitboard) | eastOne(bitboard);

attacks |= soutOne(bitboard) | nortOne(bitboard);

attacks |= soEaOne(bitboard) | noEaOne(bitboard);

attacks |= soWeOne(bitboard) | noWeOne(bitboard);

return attacks;

}

U64 bishop_mask(Square square) {

int tr = square / 8, tf = square % 8;

int len[4] = {MIN(7 - tf, 7 - tr) - 1, MIN(tf, 7 - tr) - 1,

MIN(7 - tf, tr) - 1, MIN(tf, tr) - 1};

return attacks_slide_mask(square, C64(0), attacks_bishop_direction, len);

}

U64 rook_mask(Square square) {

int tr = square / 8, tf = square % 8;

int len[4] = {tf - 1, tr - 1, 6 - tf, 6 - tr};

return attacks_slide_mask(square, C64(0), attacks_rook_direction, len);

}

U64 bishop_on_the_fly(Square square, U64 block) {

int tr = square / 8, tf = square % 8;

int len[4] = {MIN(7 - tf, 7 - tr), MIN(tf, 7 - tr), MIN(7 - tf, tr),

MIN(tf, tr)};

return attacks_slide_mask(square, block, attacks_bishop_direction, len);

}

U64 rook_on_the_fly(Square square, U64 block) {

int tr = square / 8, tf = square % 8;

int len[4] = {tf, tr, 7 - tf, 7 - tr};

return attacks_slide_mask(square, block, attacks_rook_direction, len);

}

diff --git a/src/attacks/internal.h b/src/attacks/internal.h

@@ -0,0 +1,31 @@

#ifndef STELLAR_ATTAKCS_INTERNAL_H

#define STELLAR_ATTAKCS_INTERNAL_H

#include "piece.h" // BLACK, WHITE

#include "utils.h"

extern U64 king_attacks[64]; // king attack table [square]

extern U64 knight_attacks[64]; // knight attack table [square]

extern U64 pawn_attacks[2][64]; // pawn attack table [side][square]

extern U64 rook_attacks[64][4096]; // rook attack table [square][occupancies]

extern U64 bishop_attacks[64][512]; // bishop attack table [square][occupancies]

extern U64 rook_masks[64]; // rook attack mask

extern U64 bishop_masks[64]; // bishop attack mask

extern const int rook_relevant_bits[64];

extern const int bishop_relevant_bits[64];

int hash(U64 key, U64 magic, int relevant_bits);

U64 set_occupancy(int index, int bits_in_mask, U64 attack_mask);

U64 bishop_mask(Square square);

U64 bishop_on_the_fly(Square square, U64 block);

U64 king_mask(Square square);

U64 knight_mask(Square square);

U64 pawn_mask(int side, Square square);

U64 rook_mask(Square square);

U64 rook_on_the_fly(Square square, U64 block);

#endif

diff --git a/src/attacks/magic.c b/src/attacks/magic.c

@@ -0,0 +1,51 @@