Simplify away QueenContactCheck

snicolet · Jan 30, 2017 · cbe862f · cbe862f · locutus2 · Jan 30, 2017
1 parent bcf498a
commit cbe862f
Showing 1 changed file with 0 additions and 8 deletions.
diff --git a/src/evaluate.cpp b/src/evaluate.cpp
@@ -209,7 +209,6 @@ namespace {
   const int KingAttackWeights[PIECE_TYPE_NB] = { 0, 0, 78, 56, 45, 11 };
 
   // Penalties for enemy's safe checks
-  const int QueenContactCheck = 997;
   const int QueenCheck        = 745;
   const int RookCheck         = 688;
   const int BishopCheck       = 588;
@@ -430,13 +429,6 @@ namespace {
                     - 717 * !pos.count<QUEEN>(Them)
                     -   7 * mg_value(score) / 5 - 5;
 
-        // Analyse the enemy's safe queen contact checks. Firstly, find the
-        // undefended squares around our king reachable by the enemy queen...
-        b = undefended & ei.attackedBy[Them][QUEEN] & ~pos.pieces(Them);
-
-        // ...and keep squares supported by another enemy piece.
-        kingDanger += QueenContactCheck * popcount(b & ei.attackedBy2[Them]);
-
         // Analyse the safe enemy's checks which are possible on next move
         safe  = ~pos.pieces(Them);
         safe &= (~ei.attackedBy[Us][ALL_PIECES] | (undefended & ei.attackedBy2[Them]));