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

Small tweaks in pawns.cpp

Browse source 
No functional change.
This commit is contained in:
Marco Costalba 2015-02-24 11:33:40 +01:00
parent d3d26a94b3
commit 153fb216a1
1 changed files with 7 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
src/pawns.cpp
View file

@ -138,13 +138,12 @@ namespace {
e->semiopenFiles[Us] &= ~(1 << f); e->semiopenFiles[Us] &= ~(1 << f);
// Previous rank // Previous rank
p = rank_bb(s - pawn_push(Us)); p = rank_bb(s - Up);
// Flag the pawn as passed, isolated, doubled, // Flag the pawn
// unsupported or connected (but not the backward one).
connected = ourPawns & adjacent_files_bb(f) & (rank_bb(s) | p); connected = ourPawns & adjacent_files_bb(f) & (rank_bb(s) | p);
phalanx = connected & rank_bb(s); phalanx = connected & rank_bb(s);
unsupported = !(ourPawns & adjacent_files_bb(f) & p); unsupported = !(connected & p);
isolated = !(ourPawns & adjacent_files_bb(f)); isolated = !(ourPawns & adjacent_files_bb(f));
doubled = ourPawns & forward_bb(Us, s); doubled = ourPawns & forward_bb(Us, s);
opposed = theirPawns & forward_bb(Us, s); opposed = theirPawns & forward_bb(Us, s);
@ -152,7 +151,7 @@ namespace {
lever = theirPawns & pawnAttacksBB[s]; lever = theirPawns & pawnAttacksBB[s];
// Test for backward pawn. // Test for backward pawn.
// If the pawn is passed, isolated, connected or a lever it cannot be // If the pawn is passed, isolated, lever or connected it cannot be
// backward. If there are friendly pawns behind on adjacent files // backward. If there are friendly pawns behind on adjacent files
// it cannot be backward either. // it cannot be backward either.
if ( (passed | isolated | lever | connected) if ( (passed | isolated | lever | connected)
@ -160,7 +159,7 @@ namespace {
backward = false; backward = false;
else else
{ {
// We now know that there are no friendly pawns beside or behind this // We now know there are no friendly pawns beside or behind this
// pawn on adjacent files. We now check whether the pawn is // pawn on adjacent files. We now check whether the pawn is
// backward by looking in the forward direction on the adjacent // backward by looking in the forward direction on the adjacent
// files, and picking the closest pawn there. // files, and picking the closest pawn there.
@ -226,9 +225,8 @@ void init()
for (int phalanx = 0; phalanx <= 1; ++phalanx) for (int phalanx = 0; phalanx <= 1; ++phalanx)
for (Rank r = RANK_2; r < RANK_8; ++r) for (Rank r = RANK_2; r < RANK_8; ++r)
{ {
int bonus = Seed[r] + (phalanx ? (Seed[r + 1] - Seed[r]) / 2 : 0); int v = (Seed[r] + (phalanx ? (Seed[r + 1] - Seed[r]) / 2 : 0)) >> opposed;
bonus >>= opposed; Connected[opposed][phalanx][r] = make_score( 3 * v / 2, v);
Connected[opposed][phalanx][r] = make_score( 3 * bonus / 2, bonus);
} }
} }