Skip to content

Winnable, STC pass! #156

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ProgramciDusunur merged 3 commits into from
Jan 8, 2025
Merged

Winnable, STC pass! #156

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
6e7a8d0
add winnable heuristic
ProgramciDusunur Jan 7, 2025
3deb407
bench: 13055370
ProgramciDusunur Jan 7, 2025
601aaf0
bench: 12931996
ProgramciDusunur Jan 7, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions src/evaluation.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -329,6 +329,9 @@ int evaluate(board* position) {
// penalties
//int double_pawns = 0;

// passer pawn count
int passedPawnCount = 0;

// loop over piece bitboards
for (int bb_piece = P; bb_piece <= k; bb_piece++) {
// init piece bitboard copy
Expand Down Expand Up @@ -404,6 +407,7 @@ int evaluate(board* position) {
if ((whitePassedMasks[square] & position->bitboards[p]) == 0) {
// give passed pawn bonus
if (game_phase == endgame) {
passedPawnCount += 1;

// passed pawn can move bonus
if (!(getBit(position->occupancies[both], (square - 8)))) {
Expand Down Expand Up @@ -588,6 +592,7 @@ int evaluate(board* position) {
if ((blackPassedMasks[square] & position->bitboards[P]) == 0) {
// give passed pawn bonus
if (game_phase == endgame) {
passedPawnCount -= 1;

// passed pawn can move bonus
if (!(getBit(position->occupancies[both], (square + 8)))) {
Expand Down Expand Up @@ -747,6 +752,22 @@ int evaluate(board* position) {
popBit(bitboard, square);
}
}

int infiltriation = 0;
if (!position->side && get_rank[getLS1BIndex(position->bitboards[K])] > 5) {
infiltriation = 20;
} else if (position->side && get_rank[getLS1BIndex(position->bitboards[k])] < 2) {
infiltriation = -20;
}
// winnable
int winnableScore = 6 * passedPawnCount +
8 * (countBits(position->bitboards[P]) - countBits(position->bitboards[p])) +
infiltriation
;
score += winnableScore;



int tempo = 10;
// return final evaluation based on side
return (position->side == white) ? score + tempo : -(score - tempo);
Expand Down