kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-29 16:23:09 +00:00
Code Issues Releases Wiki Activity

Weight backward-ness of a pawn

Browse source 
Because not all backward pawns are the same ;-) if the
blocking enemy pawn is near then our pawn is more backward
than another whose enemy pawn is far away so that can advance
for some sqaures.

After 2925 games at 30"+0 on my QUAD
Mod vs Orig +602 =1745 -578 +3 ELO

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2010-07-19 08:56:14 +02:00
parent 6aef4429fd
commit 26a8b84417
1 changed files with 8 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
src/pawns.cpp
View file

@ -183,7 +183,7 @@ Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns,
Square s; Square s;
File f; File f;
Rank r; Rank r;
int bonus; int bonus, backwardWeight;
bool passed, isolated, doubled, opposed, chain, backward, candidate; bool passed, isolated, doubled, opposed, chain, backward, candidate;
Score value = make_score(0, 0); Score value = make_score(0, 0);
const Square* ptr = pos.piece_list_begin(Us, PAWN); const Square* ptr = pos.piece_list_begin(Us, PAWN);
@ -227,6 +227,7 @@ Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns,
// Test for backward pawn // Test for backward pawn
// //
backward = false; backward = false;
backwardWeight = 6;
// If the pawn is passed, isolated, or member of a pawn chain // If the pawn is passed, isolated, or member of a pawn chain
// it cannot be backward. If can capture an enemy pawn or if // it cannot be backward. If can capture an enemy pawn or if
@ -245,7 +246,12 @@ Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns,
// Note that we are sure to find something because pawn is not passed // Note that we are sure to find something because pawn is not passed
// nor isolated, so loop is potentially infinite, but it isn't. // nor isolated, so loop is potentially infinite, but it isn't.
while (!(b & (ourPawns | theirPawns))) while (!(b & (ourPawns | theirPawns)))
{
Us == WHITE ? b <<= 8 : b >>= 8; Us == WHITE ? b <<= 8 : b >>= 8;
backwardWeight--;
}
assert(backwardWeight > 0);
// The friendly pawn needs to be at least two ranks closer than the enemy // The friendly pawn needs to be at least two ranks closer than the enemy
// pawn in order to help the potentially backward pawn advance. // pawn in order to help the potentially backward pawn advance.
@ -282,7 +288,7 @@ Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns,
if (backward) if (backward)
{ {
value -= BackwardPawnPenalty[f]; value -= backwardWeight * BackwardPawnPenalty[f] / 4;
if (!opposed) if (!opposed)
value -= BackwardPawnPenalty[f] / 2; value -= BackwardPawnPenalty[f] / 2;
} }