S(248, 271), S(233, 201), S(252, 259), S(46, 0), S(247, 0), S(259, 0)
};
- // Knight mobility bonus in middle game and endgame, indexed by the number
- // of attacked squares not occupied by friendly piecess.
- const Score KnightMobilityBonus[16] = {
- S(-38,-33), S(-25,-23), S(-12,-13), S( 0,-3),
- S( 12, 7), S( 25, 17), S( 31, 22), S(38, 27), S(38, 27)
+ // MobilityBonus[PieceType][attacked] contains mobility bonuses for middle and
+ // end game, indexed by piece type and number of attacked squares not occupied
+ // by friendly pieces.
+ const Score MobilityBonus[][32] = {
+ {}, {},
+ { S(-38,-33), S(-25,-23), S(-12,-13), S( 0, -3), S(12, 7), S(25, 17), // Knights
+ S( 31, 22), S( 38, 27), S( 38, 27) },
+ { S(-25,-30), S(-11,-16), S( 3, -2), S(17, 12), S(31, 26), S(45, 40), // Bishops
+ S( 57, 52), S( 65, 60), S( 71, 65), S(74, 69), S(76, 71), S(78, 73),
+ S( 79, 74), S( 80, 75), S( 81, 76), S(81, 76) },
+ { S(-20,-36), S(-14,-19), S( -8, -3), S(-2, 13), S( 4, 29), S(10, 46), // Rooks
+ S( 14, 62), S( 19, 79), S( 23, 95), S(26,106), S(27,111), S(28,114),
+ S( 29,116), S( 30,117), S( 31,118), S(32,118) },
+ { S(-10,-18), S( -8,-13), S( -6, -7), S(-3, -2), S(-1, 3), S( 1, 8), // Queens
+ S( 3, 13), S( 5, 19), S( 8, 23), S(10, 27), S(12, 32), S(15, 34),
+ S( 16, 35), S( 17, 35), S( 18, 35), S(20, 35), S(20, 35), S(20, 35),
+ S( 20, 35), S( 20, 35), S( 20, 35), S(20, 35), S(20, 35), S(20, 35),
+ S( 20, 35), S( 20, 35), S( 20, 35), S(20, 35), S(20, 35), S(20, 35),
+ S( 20, 35), S( 20, 35) }
};
- // Bishop mobility bonus in middle game and endgame, indexed by the number
- // of attacked squares not occupied by friendly pieces. X-ray attacks through
- // queens are also included.
- const Score BishopMobilityBonus[16] = {
- S(-25,-30), S(-11,-16), S( 3, -2), S(17, 12),
- S( 31, 26), S( 45, 40), S(57, 52), S(65, 60),
- S( 71, 65), S( 74, 69), S(76, 71), S(78, 73),
- S( 79, 74), S( 80, 75), S(81, 76), S(81, 76)
- };
-
- // Rook mobility bonus in middle game and endgame, indexed by the number
- // of attacked squares not occupied by friendly pieces. X-ray attacks through
- // queens and rooks are also included.
- const Score RookMobilityBonus[16] = {
- S(-20,-36), S(-14,-19), S(-8, -3), S(-2, 13),
- S( 4, 29), S( 10, 46), S(14, 62), S(19, 79),
- S( 23, 95), S( 26,106), S(27,111), S(28,114),
- S( 29,116), S( 30,117), S(31,118), S(32,118)
- };
-
- // Queen mobility bonus in middle game and endgame, indexed by the number
- // of attacked squares not occupied by friendly pieces.
- const Score QueenMobilityBonus[32] = {
- S(-10,-18), S(-8,-13), S(-6, -7), S(-3, -2), S(-1, 3), S( 1, 8),
- S( 3, 13), S( 5, 19), S( 8, 23), S(10, 27), S(12, 32), S(15, 34),
- S( 16, 35), S(17, 35), S(18, 35), S(20, 35), S(20, 35), S(20, 35),
- S( 20, 35), S(20, 35), S(20, 35), S(20, 35), S(20, 35), S(20, 35),
- S( 20, 35), S(20, 35), S(20, 35), S(20, 35), S(20, 35), S(20, 35),
- S( 20, 35), S(20, 35)
- };
-
- // Pointers table to access mobility tables through piece type
- const Score* MobilityBonus[8] = { 0, 0, KnightMobilityBonus, BishopMobilityBonus,
- RookMobilityBonus, QueenMobilityBonus, 0, 0 };
-
- // Outpost bonuses for knights and bishops, indexed by square (from white's
- // point of view).
- const Value KnightOutpostBonus[64] = {
- // A B C D E F G H
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 1
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 2
- V(0), V(0), V(4), V(8), V(8), V(4), V(0), V(0), // 3
- V(0), V(4),V(17),V(26),V(26),V(17), V(4), V(0), // 4
- V(0), V(8),V(26),V(35),V(35),V(26), V(8), V(0), // 5
- V(0), V(4),V(17),V(17),V(17),V(17), V(4), V(0), // 6
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 7
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0) // 8
- };
-
- const Value BishopOutpostBonus[64] = {
+ // OutpostBonus[PieceType][Square] contains outpost bonuses of knights and
+ // bishops, indexed by piece type and square (from white's point of view).
+ const Value OutpostBonus[][64] = {
+ {
// A B C D E F G H
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 1
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 2
- V(0), V(0), V(5), V(5), V(5), V(5), V(0), V(0), // 3
- V(0), V(5),V(10),V(10),V(10),V(10), V(5), V(0), // 4
- V(0),V(10),V(21),V(21),V(21),V(21),V(10), V(0), // 5
- V(0), V(5), V(8), V(8), V(8), V(8), V(5), V(0), // 6
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 7
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0) // 8
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // Knights
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
+ V(0), V(0), V(4), V(8), V(8), V(4), V(0), V(0),
+ V(0), V(4),V(17),V(26),V(26),V(17), V(4), V(0),
+ V(0), V(8),V(26),V(35),V(35),V(26), V(8), V(0),
+ V(0), V(4),V(17),V(17),V(17),V(17), V(4), V(0),
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0) },
+ {
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // Bishops
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
+ V(0), V(0), V(5), V(5), V(5), V(5), V(0), V(0),
+ V(0), V(5),V(10),V(10),V(10),V(10), V(5), V(0),
+ V(0),V(10),V(21),V(21),V(21),V(21),V(10), V(0),
+ V(0), V(5), V(8), V(8), V(8), V(8), V(5), V(0),
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
+ V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0) }
};
- // ThreatBonus[attacking][attacked] contains bonus according to which
- // piece type attacks which one.
- const Score ThreatBonus[8][8] = {
+ // ThreatBonus[attacking][attacked] contains threat bonuses according to
+ // which piece type attacks which one.
+ const Score ThreatBonus[][8] = {
{}, {},
{ S(0, 0), S( 7, 39), S( 0, 0), S(24, 49), S(41,100), S(41,100) }, // KNIGHT
{ S(0, 0), S( 7, 39), S(24, 49), S( 0, 0), S(41,100), S(41,100) }, // BISHOP
{ S(0, 0), S(15, 39), S(15, 39), S(15, 39), S(15, 39), S( 0, 0) } // QUEEN
};
- // ThreatedByPawnPenalty[] contains a penalty according to which piece
- // type is attacked by an enemy pawn.
- const Score ThreatedByPawnPenalty[8] = {
+ // ThreatedByPawnPenalty[PieceType] contains a penalty according to which
+ // piece type is attacked by an enemy pawn.
+ const Score ThreatedByPawnPenalty[] = {
S(0, 0), S(0, 0), S(56, 70), S(56, 70), S(76, 99), S(86, 118)
};
// right to castle.
const Value TrappedRookPenalty = Value(180);
- // The SpaceMask[color] contains the area of the board which is considered
+ // The SpaceMask[Color] contains the area of the board which is considered
// by the space evaluation. In the middle game, each side is given a bonus
// based on how many squares inside this area are safe and available for
// friendly minor pieces.
const Bitboard SpaceMask[2] = {
- (1ULL<<SQ_C2) | (1ULL<<SQ_D2) | (1ULL<<SQ_E2) | (1ULL<<SQ_F2) |
- (1ULL<<SQ_C3) | (1ULL<<SQ_D3) | (1ULL<<SQ_E3) | (1ULL<<SQ_F3) |
- (1ULL<<SQ_C4) | (1ULL<<SQ_D4) | (1ULL<<SQ_E4) | (1ULL<<SQ_F4),
- (1ULL<<SQ_C7) | (1ULL<<SQ_D7) | (1ULL<<SQ_E7) | (1ULL<<SQ_F7) |
- (1ULL<<SQ_C6) | (1ULL<<SQ_D6) | (1ULL<<SQ_E6) | (1ULL<<SQ_F6) |
- (1ULL<<SQ_C5) | (1ULL<<SQ_D5) | (1ULL<<SQ_E5) | (1ULL<<SQ_F5)
+ (1ULL << SQ_C2) | (1ULL << SQ_D2) | (1ULL << SQ_E2) | (1ULL << SQ_F2) |
+ (1ULL << SQ_C3) | (1ULL << SQ_D3) | (1ULL << SQ_E3) | (1ULL << SQ_F3) |
+ (1ULL << SQ_C4) | (1ULL << SQ_D4) | (1ULL << SQ_E4) | (1ULL << SQ_F4),
+ (1ULL << SQ_C7) | (1ULL << SQ_D7) | (1ULL << SQ_E7) | (1ULL << SQ_F7) |
+ (1ULL << SQ_C6) | (1ULL << SQ_D6) | (1ULL << SQ_E6) | (1ULL << SQ_F6) |
+ (1ULL << SQ_C5) | (1ULL << SQ_D5) | (1ULL << SQ_E5) | (1ULL << SQ_F5)
};
- /// King danger constants and variables. The king danger scores are taken
- /// from the KingDangerTable[]. Various little "meta-bonuses" measuring
- /// the strength of the enemy attack are added up into an integer, which
- /// is used as an index to KingDangerTable[].
-
- // KingAttackWeights[] contains king attack weights by piece type
- const int KingAttackWeights[8] = { 0, 0, 2, 2, 3, 5 };
+ // King danger constants and variables. The king danger scores are taken
+ // from the KingDangerTable[]. Various little "meta-bonuses" measuring
+ // the strength of the enemy attack are added up into an integer, which
+ // is used as an index to KingDangerTable[].
+ //
+ // KingAttackWeights[PieceType] contains king attack weights by piece type
+ const int KingAttackWeights[] = { 0, 0, 2, 2, 3, 5 };
// Bonuses for enemy's safe checks
const int QueenContactCheckBonus = 3;
const int BishopCheckBonus = 1;
const int KnightCheckBonus = 1;
- // InitKingDanger[] contains bonuses based on the position of the defending
- // king.
- const int InitKingDanger[64] = {
+ // InitKingDanger[Square] contains penalties based on the position of the
+ // defending king, indexed by king's square (from white's point of view).
+ const int InitKingDanger[] = {
2, 0, 2, 5, 5, 2, 0, 2,
2, 2, 4, 8, 8, 4, 2, 2,
7, 10, 12, 12, 12, 12, 10, 7,
15, 15, 15, 15, 15, 15, 15, 15
};
- // KingDangerTable[color][] contains the actual king danger weighted scores
+ // KingDangerTable[Color][attackUnits] contains the actual king danger
+ // weighted scores, indexed by color and by a calculated integer number.
Score KingDangerTable[2][128];
// Pawn and material hash tables, indexed by the current thread id.
// Middle-game specific evaluation terms
if (phase > PHASE_ENDGAME)
{
- // Pawn storms in positions with opposite castling
+ // Evaluate pawn storms in positions with opposite castling
if ( square_file(pos.king_square(WHITE)) >= FILE_E
&& square_file(pos.king_square(BLACK)) <= FILE_D)
const Color Them = (Us == WHITE ? BLACK : WHITE);
+ assert (Piece == BISHOP || Piece == KNIGHT);
+
// Initial bonus based on square
- Value bonus = (Piece == BISHOP ? BishopOutpostBonus[relative_square(Us, s)]
- : KnightOutpostBonus[relative_square(Us, s)]);
+ Value bonus = OutpostBonus[Piece == BISHOP][relative_square(Us, s)];
// Increase bonus if supported by pawn, especially if the opponent has
// no minor piece which can exchange the outpost piece
projects / stockfish / blobdiff