2008-08-31 23:59:13 -06:00
|
|
|
/*
|
2008-10-19 10:56:28 -06:00
|
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
2014-01-01 17:48:07 -07:00
|
|
|
Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2008-10-19 10:56:28 -06:00
|
|
|
Stockfish is free software: you can redistribute it and/or modify
|
2008-08-31 23:59:13 -06:00
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
2008-09-23 16:32:53 -06:00
|
|
|
|
2008-10-19 10:56:28 -06:00
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
2008-08-31 23:59:13 -06:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
2008-09-23 16:32:53 -06:00
|
|
|
|
2008-08-31 23:59:13 -06:00
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2014-05-03 04:09:56 -06:00
|
|
|
#include <algorithm>
|
2008-08-31 23:59:13 -06:00
|
|
|
#include <cassert>
|
2011-02-26 06:09:58 -07:00
|
|
|
#include <iomanip>
|
|
|
|
#include <sstream>
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2009-05-21 07:29:28 -06:00
|
|
|
#include "bitcount.h"
|
2008-08-31 23:59:13 -06:00
|
|
|
#include "evaluate.h"
|
2013-04-28 16:54:08 -06:00
|
|
|
#include "material.h"
|
|
|
|
#include "pawns.h"
|
2008-08-31 23:59:13 -06:00
|
|
|
#include "thread.h"
|
|
|
|
|
2013-04-25 04:43:55 -06:00
|
|
|
namespace {
|
2010-08-25 12:56:01 -06:00
|
|
|
|
2013-04-28 16:54:08 -06:00
|
|
|
// Struct EvalInfo contains various information computed and collected
|
|
|
|
// by the evaluation functions.
|
|
|
|
struct EvalInfo {
|
|
|
|
|
|
|
|
// Pointers to material and pawn hash table entries
|
|
|
|
Material::Entry* mi;
|
|
|
|
Pawns::Entry* pi;
|
|
|
|
|
|
|
|
// attackedBy[color][piece type] is a bitboard representing all squares
|
|
|
|
// attacked by a given color and piece type, attackedBy[color][ALL_PIECES]
|
|
|
|
// contains all squares attacked by the given color.
|
|
|
|
Bitboard attackedBy[COLOR_NB][PIECE_TYPE_NB];
|
|
|
|
|
|
|
|
// kingRing[color] is the zone around the king which is considered
|
|
|
|
// by the king safety evaluation. This consists of the squares directly
|
|
|
|
// adjacent to the king, and the three (or two, for a king on an edge file)
|
|
|
|
// squares two ranks in front of the king. For instance, if black's king
|
|
|
|
// is on g8, kingRing[BLACK] is a bitboard containing the squares f8, h8,
|
|
|
|
// f7, g7, h7, f6, g6 and h6.
|
|
|
|
Bitboard kingRing[COLOR_NB];
|
|
|
|
|
|
|
|
// kingAttackersCount[color] is the number of pieces of the given color
|
|
|
|
// which attack a square in the kingRing of the enemy king.
|
|
|
|
int kingAttackersCount[COLOR_NB];
|
|
|
|
|
|
|
|
// kingAttackersWeight[color] is the sum of the "weight" of the pieces of the
|
|
|
|
// given color which attack a square in the kingRing of the enemy king. The
|
2014-11-18 15:39:17 -07:00
|
|
|
// weights of the individual piece types are given by the elements in the
|
|
|
|
// KingAttackWeights array.
|
2013-04-28 16:54:08 -06:00
|
|
|
int kingAttackersWeight[COLOR_NB];
|
|
|
|
|
|
|
|
// kingAdjacentZoneAttacksCount[color] is the number of attacks to squares
|
|
|
|
// directly adjacent to the king of the given color. Pieces which attack
|
|
|
|
// more than one square are counted multiple times. For instance, if black's
|
|
|
|
// king is on g8 and there's a white knight on g5, this knight adds
|
|
|
|
// 2 to kingAdjacentZoneAttacksCount[BLACK].
|
|
|
|
int kingAdjacentZoneAttacksCount[COLOR_NB];
|
2013-11-07 11:59:11 -07:00
|
|
|
|
|
|
|
Bitboard pinnedPieces[COLOR_NB];
|
2013-04-28 16:54:08 -06:00
|
|
|
};
|
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
namespace Tracing {
|
|
|
|
|
|
|
|
enum Terms { // First 8 entries are for PieceType
|
2014-06-08 14:30:18 -06:00
|
|
|
MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, TOTAL, TERMS_NB
|
2014-02-15 05:27:16 -07:00
|
|
|
};
|
|
|
|
|
2014-10-11 01:52:16 -06:00
|
|
|
Score scores[COLOR_NB][TERMS_NB];
|
2014-02-15 05:27:16 -07:00
|
|
|
EvalInfo ei;
|
|
|
|
ScaleFactor sf;
|
|
|
|
|
|
|
|
double to_cp(Value v);
|
2014-10-11 01:52:16 -06:00
|
|
|
void write(int idx, Color c, Score s);
|
|
|
|
void write(int idx, Score w, Score b = SCORE_ZERO);
|
|
|
|
void print(std::stringstream& ss, const char* name, int idx);
|
2014-02-15 05:27:16 -07:00
|
|
|
std::string do_trace(const Position& pos);
|
|
|
|
}
|
|
|
|
|
2014-06-01 05:37:21 -06:00
|
|
|
// Evaluation weights, indexed by evaluation term
|
2014-06-03 06:48:43 -06:00
|
|
|
enum { Mobility, PawnStructure, PassedPawns, Space, KingSafety };
|
2014-06-01 05:37:21 -06:00
|
|
|
const struct Weight { int mg, eg; } Weights[] = {
|
2014-06-03 06:48:43 -06:00
|
|
|
{289, 344}, {233, 201}, {221, 273}, {46, 0}, {318, 0}
|
2014-06-01 05:37:21 -06:00
|
|
|
};
|
2010-05-06 01:58:04 -06:00
|
|
|
|
|
|
|
typedef Value V;
|
|
|
|
#define S(mg, eg) make_score(mg, eg)
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2013-06-01 03:48:38 -06:00
|
|
|
// MobilityBonus[PieceType][attacked] contains bonuses for middle and end
|
|
|
|
// game, indexed by piece type and number of attacked squares not occupied by
|
|
|
|
// friendly pieces.
|
2010-08-24 04:29:44 -06:00
|
|
|
const Score MobilityBonus[][32] = {
|
2014-02-15 05:27:16 -07:00
|
|
|
{}, {},
|
2014-04-11 10:14:57 -06:00
|
|
|
{ S(-65,-50), S(-42,-30), S(-9,-10), S( 3, 0), S(15, 10), S(27, 20), // Knights
|
2014-02-15 05:27:16 -07:00
|
|
|
S( 37, 28), S( 42, 31), S(44, 33) },
|
2014-04-11 10:14:57 -06:00
|
|
|
{ S(-52,-47), S(-28,-23), S( 6, 1), S(20, 15), S(34, 29), S(48, 43), // Bishops
|
2014-02-15 05:27:16 -07:00
|
|
|
S( 60, 55), S( 68, 63), S(74, 68), S(77, 72), S(80, 75), S(82, 77),
|
|
|
|
S( 84, 79), S( 86, 81) },
|
2014-04-11 10:14:57 -06:00
|
|
|
{ S(-47,-53), S(-31,-26), S(-5, 0), S( 1, 16), S( 7, 32), S(13, 48), // Rooks
|
2014-02-15 05:27:16 -07:00
|
|
|
S( 18, 64), S( 22, 80), S(26, 96), S(29,109), S(31,115), S(33,119),
|
|
|
|
S( 35,122), S( 36,123), S(37,124) },
|
2014-04-11 10:14:57 -06:00
|
|
|
{ S(-42,-40), S(-28,-23), S(-5, -7), S( 0, 0), S( 6, 10), S(11, 19), // Queens
|
2014-04-08 13:50:01 -06:00
|
|
|
S( 13, 29), S( 18, 38), S(20, 40), S(21, 41), S(22, 41), S(22, 41),
|
2014-02-15 05:27:16 -07:00
|
|
|
S( 22, 41), S( 23, 41), S(24, 41), S(25, 41), S(25, 41), S(25, 41),
|
|
|
|
S( 25, 41), S( 25, 41), S(25, 41), S(25, 41), S(25, 41), S(25, 41),
|
|
|
|
S( 25, 41), S( 25, 41), S(25, 41), S(25, 41) }
|
2008-08-31 23:59:13 -06:00
|
|
|
};
|
|
|
|
|
2013-12-02 15:47:38 -07:00
|
|
|
// Outpost[PieceType][Square] contains bonuses for knights and bishops outposts,
|
|
|
|
// indexed by piece type and square (from white's point of view).
|
2013-06-01 03:48:38 -06:00
|
|
|
const Value Outpost[][SQUARE_NB] = {
|
2014-02-15 05:27:16 -07:00
|
|
|
{// A B C D E F G H
|
2010-08-24 04:29:44 -06:00
|
|
|
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),
|
2010-09-25 04:12:55 -06:00
|
|
|
V(0), V(4),V(17),V(17),V(17),V(17), V(4), V(0) },
|
2010-08-24 04:29:44 -06:00
|
|
|
{
|
|
|
|
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),
|
2010-09-25 04:12:55 -06:00
|
|
|
V(0), V(5), V(8), V(8), V(8), V(8), V(5), V(0) }
|
2008-08-31 23:59:13 -06:00
|
|
|
};
|
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
// Threat[defended/weak][minor/major attacking][attacked PieceType] contains
|
|
|
|
// bonuses according to which piece type attacks which one.
|
|
|
|
const Score Threat[][2][PIECE_TYPE_NB] = {
|
|
|
|
{ { S(0, 0), S( 0, 0), S(19, 37), S(24, 37), S(44, 97), S(35,106) }, // Defended Minor
|
|
|
|
{ S(0, 0), S( 0, 0), S( 9, 14), S( 9, 14), S( 7, 14), S(24, 48) } }, // Defended Major
|
|
|
|
{ { S(0, 0), S( 0,32), S(33, 41), S(31, 50), S(41,100), S(35,104) }, // Weak Minor
|
|
|
|
{ S(0, 0), S( 0,27), S(26, 57), S(26, 57), S(0 , 43), S(23, 51) } } // Weak Major
|
2009-11-12 09:42:43 -07:00
|
|
|
};
|
|
|
|
|
2013-06-01 03:48:38 -06:00
|
|
|
// ThreatenedByPawn[PieceType] contains a penalty according to which piece
|
|
|
|
// type is attacked by an enemy pawn.
|
|
|
|
const Score ThreatenedByPawn[] = {
|
2014-11-04 08:40:37 -07:00
|
|
|
S(0, 0), S(0, 0), S(87, 118), S(84, 122), S(114, 203), S(121, 217)
|
2009-11-12 09:42:43 -07:00
|
|
|
};
|
|
|
|
|
2014-09-20 02:19:21 -06:00
|
|
|
// Assorted bonuses and penalties used by evaluation
|
2014-11-09 01:24:06 -07:00
|
|
|
const Score KingOnOne = S( 2, 58);
|
|
|
|
const Score KingOnMany = S( 6,125);
|
|
|
|
const Score RookOnPawn = S( 7, 27);
|
2014-09-20 02:19:21 -06:00
|
|
|
const Score RookOpenFile = S(43, 21);
|
|
|
|
const Score RookSemiOpenFile = S(19, 10);
|
|
|
|
const Score BishopPawns = S( 8, 12);
|
|
|
|
const Score MinorBehindPawn = S(16, 0);
|
|
|
|
const Score TrappedRook = S(92, 0);
|
|
|
|
const Score Unstoppable = S( 0, 20);
|
2014-11-04 08:40:37 -07:00
|
|
|
const Score Hanging = S(31, 26);
|
2013-04-19 01:41:28 -06:00
|
|
|
|
2011-01-03 14:32:57 -07:00
|
|
|
// Penalty for a bishop on a1/h1 (a8/h8 for black) which is trapped by
|
|
|
|
// a friendly pawn on b2/g2 (b7/g7 for black). This can obviously only
|
|
|
|
// happen in Chess960 games.
|
2014-09-20 02:19:21 -06:00
|
|
|
const Score TrappedBishopA1H1 = S(50, 50);
|
|
|
|
|
|
|
|
#undef S
|
2012-03-21 06:19:21 -06:00
|
|
|
|
2013-12-04 23:18:12 -07:00
|
|
|
// SpaceMask[Color] contains the area of the board which is considered
|
|
|
|
// by the space evaluation. In the middlegame, each side is given a bonus
|
2008-12-21 08:26:36 -07:00
|
|
|
// based on how many squares inside this area are safe and available for
|
|
|
|
// friendly minor pieces.
|
2010-08-26 00:27:57 -06:00
|
|
|
const Bitboard SpaceMask[] = {
|
2013-09-10 05:54:05 -06:00
|
|
|
(FileCBB | FileDBB | FileEBB | FileFBB) & (Rank2BB | Rank3BB | Rank4BB),
|
|
|
|
(FileCBB | FileDBB | FileEBB | FileFBB) & (Rank7BB | Rank6BB | Rank5BB)
|
2008-12-21 08:26:36 -07:00
|
|
|
};
|
|
|
|
|
2010-08-24 06:48:40 -06:00
|
|
|
// King danger constants and variables. The king danger scores are taken
|
2013-12-04 23:18:12 -07:00
|
|
|
// from KingDanger[]. Various little "meta-bonuses" measuring the strength
|
|
|
|
// of the enemy attack are added up into an integer, which is used as an
|
|
|
|
// index to KingDanger[].
|
2010-08-24 06:48:40 -06:00
|
|
|
//
|
|
|
|
// KingAttackWeights[PieceType] contains king attack weights by piece type
|
|
|
|
const int KingAttackWeights[] = { 0, 0, 2, 2, 3, 5 };
|
2009-11-07 07:02:10 -07:00
|
|
|
|
2010-05-06 03:13:07 -06:00
|
|
|
// Bonuses for enemy's safe checks
|
2013-10-22 09:33:11 -06:00
|
|
|
const int QueenContactCheck = 24;
|
|
|
|
const int RookContactCheck = 16;
|
|
|
|
const int QueenCheck = 12;
|
|
|
|
const int RookCheck = 8;
|
|
|
|
const int BishopCheck = 2;
|
|
|
|
const int KnightCheck = 3;
|
2013-06-01 03:48:38 -06:00
|
|
|
|
2014-06-03 06:48:43 -06:00
|
|
|
// KingDanger[attackUnits] contains the actual king danger weighted
|
|
|
|
// scores, indexed by a calculated integer number.
|
|
|
|
Score KingDanger[128];
|
2011-02-26 06:09:58 -07:00
|
|
|
|
2014-04-12 02:17:41 -06:00
|
|
|
// apply_weight() weighs score 'v' by weight 'w' trying to prevent overflow
|
2014-04-12 00:32:52 -06:00
|
|
|
Score apply_weight(Score v, const Weight& w) {
|
|
|
|
return make_score(mg_value(v) * w.mg / 256, eg_value(v) * w.eg / 256);
|
2013-06-01 03:48:38 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-08-26 00:27:57 -06:00
|
|
|
// init_eval_info() initializes king bitboards for given color adding
|
|
|
|
// pawn attacks. To be done at the beginning of the evaluation.
|
2010-05-15 06:29:21 -06:00
|
|
|
|
2011-12-30 03:30:26 -07:00
|
|
|
template<Color Us>
|
2013-04-28 16:54:08 -06:00
|
|
|
void init_eval_info(const Position& pos, EvalInfo& ei) {
|
2010-05-15 06:29:21 -06:00
|
|
|
|
2013-06-16 02:08:44 -06:00
|
|
|
const Color Them = (Us == WHITE ? BLACK : WHITE);
|
|
|
|
const Square Down = (Us == WHITE ? DELTA_S : DELTA_N);
|
2010-05-15 06:29:21 -06:00
|
|
|
|
2013-11-07 11:59:11 -07:00
|
|
|
ei.pinnedPieces[Us] = pos.pinned_pieces(Us);
|
|
|
|
|
2010-05-15 06:29:21 -06:00
|
|
|
Bitboard b = ei.attackedBy[Them][KING] = pos.attacks_from<KING>(pos.king_square(Them));
|
2014-04-11 00:38:09 -06:00
|
|
|
ei.attackedBy[Us][ALL_PIECES] = ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us);
|
2010-10-06 01:11:27 -06:00
|
|
|
|
|
|
|
// Init king safety tables only if we are going to use them
|
2014-11-06 11:00:07 -07:00
|
|
|
if (pos.non_pawn_material(Us) >= QueenValueMg)
|
2010-09-12 07:02:33 -06:00
|
|
|
{
|
2013-06-16 02:08:44 -06:00
|
|
|
ei.kingRing[Them] = b | shift_bb<Down>(b);
|
2010-09-12 07:02:33 -06:00
|
|
|
b &= ei.attackedBy[Us][PAWN];
|
2013-12-23 12:50:28 -07:00
|
|
|
ei.kingAttackersCount[Us] = b ? popcount<Max15>(b) : 0;
|
2010-10-06 01:11:27 -06:00
|
|
|
ei.kingAdjacentZoneAttacksCount[Us] = ei.kingAttackersWeight[Us] = 0;
|
2013-10-18 09:42:52 -06:00
|
|
|
}
|
|
|
|
else
|
2011-10-01 03:47:43 -06:00
|
|
|
ei.kingRing[Them] = ei.kingAttackersCount[Us] = 0;
|
2010-05-15 06:29:21 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-06-09 04:45:56 -06:00
|
|
|
// evaluate_outpost() evaluates bishop and knight outpost squares
|
2009-05-09 15:21:26 -06:00
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
template<PieceType Pt, Color Us>
|
2014-06-09 04:45:56 -06:00
|
|
|
Score evaluate_outpost(const Position& pos, const EvalInfo& ei, Square s) {
|
2009-09-28 03:46:55 -06:00
|
|
|
|
|
|
|
const Color Them = (Us == WHITE ? BLACK : WHITE);
|
2009-05-09 15:21:26 -06:00
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
assert (Pt == BISHOP || Pt == KNIGHT);
|
2010-08-24 04:29:44 -06:00
|
|
|
|
2009-05-09 15:21:26 -06:00
|
|
|
// Initial bonus based on square
|
2014-02-15 05:27:16 -07:00
|
|
|
Value bonus = Outpost[Pt == BISHOP][relative_square(Us, s)];
|
2009-05-09 15:21:26 -06:00
|
|
|
|
|
|
|
// Increase bonus if supported by pawn, especially if the opponent has
|
2013-12-04 23:18:12 -07:00
|
|
|
// no minor piece which can trade with the outpost piece.
|
2012-01-29 01:54:17 -07:00
|
|
|
if (bonus && (ei.attackedBy[Us][PAWN] & s))
|
2009-05-09 15:21:26 -06:00
|
|
|
{
|
2012-05-01 05:01:38 -06:00
|
|
|
if ( !pos.pieces(Them, KNIGHT)
|
2013-07-29 11:32:59 -06:00
|
|
|
&& !(squares_of_color(s) & pos.pieces(Them, BISHOP)))
|
2009-05-09 15:21:26 -06:00
|
|
|
bonus += bonus + bonus / 2;
|
|
|
|
else
|
|
|
|
bonus += bonus / 2;
|
2008-09-24 02:12:18 -06:00
|
|
|
}
|
2013-10-18 09:42:52 -06:00
|
|
|
|
2014-07-22 17:05:10 -06:00
|
|
|
return make_score(bonus * 2, bonus / 2);
|
2008-09-24 01:49:18 -06:00
|
|
|
}
|
|
|
|
|
2008-09-24 02:12:18 -06:00
|
|
|
|
2013-10-18 09:42:52 -06:00
|
|
|
// evaluate_pieces() assigns bonuses and penalties to the pieces of a given color
|
2008-09-24 01:49:18 -06:00
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
template<PieceType Pt, Color Us, bool Trace>
|
2014-04-10 11:45:18 -06:00
|
|
|
Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score* mobility, Bitboard* mobilityArea) {
|
2008-09-24 01:49:18 -06:00
|
|
|
|
2009-09-28 15:16:08 -06:00
|
|
|
Bitboard b;
|
2013-05-11 01:29:02 -06:00
|
|
|
Square s;
|
2011-05-02 01:43:16 -06:00
|
|
|
Score score = SCORE_ZERO;
|
2009-09-28 03:46:55 -06:00
|
|
|
|
2014-04-12 00:32:52 -06:00
|
|
|
const PieceType NextPt = (Us == WHITE ? Pt : PieceType(Pt + 1));
|
2009-09-28 03:46:55 -06:00
|
|
|
const Color Them = (Us == WHITE ? BLACK : WHITE);
|
2014-02-15 05:27:16 -07:00
|
|
|
const Square* pl = pos.list<Pt>(Us);
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
ei.attackedBy[Us][Pt] = 0;
|
2010-08-24 07:59:24 -06:00
|
|
|
|
2011-06-28 08:16:43 -06:00
|
|
|
while ((s = *pl++) != SQ_NONE)
|
2009-03-06 08:29:46 -07:00
|
|
|
{
|
2009-11-12 09:42:43 -07:00
|
|
|
// Find attacked squares, including x-ray attacks for bishops and rooks
|
2014-02-15 05:27:16 -07:00
|
|
|
b = Pt == BISHOP ? attacks_bb<BISHOP>(s, pos.pieces() ^ pos.pieces(Us, QUEEN))
|
|
|
|
: Pt == ROOK ? attacks_bb< ROOK>(s, pos.pieces() ^ pos.pieces(Us, ROOK, QUEEN))
|
|
|
|
: pos.attacks_from<Pt>(s);
|
2009-05-09 15:21:26 -06:00
|
|
|
|
2013-11-07 11:59:11 -07:00
|
|
|
if (ei.pinnedPieces[Us] & s)
|
2013-11-08 19:06:47 -07:00
|
|
|
b &= LineBB[pos.king_square(Us)][s];
|
2013-11-07 11:59:11 -07:00
|
|
|
|
2014-04-11 00:38:09 -06:00
|
|
|
ei.attackedBy[Us][ALL_PIECES] |= ei.attackedBy[Us][Pt] |= b;
|
2009-11-11 13:17:38 -07:00
|
|
|
|
2011-10-01 03:47:43 -06:00
|
|
|
if (b & ei.kingRing[Them])
|
2009-11-11 13:17:38 -07:00
|
|
|
{
|
2013-10-18 09:42:52 -06:00
|
|
|
ei.kingAttackersCount[Us]++;
|
2014-02-15 05:27:16 -07:00
|
|
|
ei.kingAttackersWeight[Us] += KingAttackWeights[Pt];
|
2013-10-18 09:42:52 -06:00
|
|
|
Bitboard bb = b & ei.attackedBy[Them][KING];
|
2009-11-11 13:17:38 -07:00
|
|
|
if (bb)
|
2011-12-31 01:46:43 -07:00
|
|
|
ei.kingAdjacentZoneAttacksCount[Us] += popcount<Max15>(bb);
|
2009-11-11 13:17:38 -07:00
|
|
|
}
|
|
|
|
|
2014-04-08 13:50:01 -06:00
|
|
|
if (Pt == QUEEN)
|
|
|
|
b &= ~( ei.attackedBy[Them][KNIGHT]
|
|
|
|
| ei.attackedBy[Them][BISHOP]
|
|
|
|
| ei.attackedBy[Them][ROOK]);
|
|
|
|
|
2014-04-10 11:45:18 -06:00
|
|
|
int mob = Pt != QUEEN ? popcount<Max15>(b & mobilityArea[Us])
|
|
|
|
: popcount<Full >(b & mobilityArea[Us]);
|
2013-07-13 15:07:24 -06:00
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
mobility[Us] += MobilityBonus[Pt][mob];
|
2009-10-25 01:16:34 -06:00
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// Decrease score if we are attacked by an enemy pawn. The remaining part
|
2009-10-25 01:16:34 -06:00
|
|
|
// of threat evaluation must be done later when we have full attack info.
|
2012-01-29 01:54:17 -07:00
|
|
|
if (ei.attackedBy[Them][PAWN] & s)
|
2014-02-15 05:27:16 -07:00
|
|
|
score -= ThreatenedByPawn[Pt];
|
2008-09-23 16:32:53 -06:00
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
if (Pt == BISHOP || Pt == KNIGHT)
|
2013-08-13 06:19:42 -06:00
|
|
|
{
|
2014-03-03 00:07:57 -07:00
|
|
|
// Penalty for bishop with same colored pawns
|
|
|
|
if (Pt == BISHOP)
|
|
|
|
score -= BishopPawns * ei.pi->pawns_on_same_color_squares(Us, s);
|
|
|
|
|
2014-06-09 04:45:56 -06:00
|
|
|
// Bishop and knight outpost square
|
2013-08-13 06:19:42 -06:00
|
|
|
if (!(pos.pieces(Them, PAWN) & pawn_attack_span(Us, s)))
|
2014-06-09 04:45:56 -06:00
|
|
|
score += evaluate_outpost<Pt, Us>(pos, ei, s);
|
2013-08-13 06:19:42 -06:00
|
|
|
|
2013-08-17 03:05:55 -06:00
|
|
|
// Bishop or knight behind a pawn
|
2013-08-13 06:19:42 -06:00
|
|
|
if ( relative_rank(Us, s) < RANK_5
|
|
|
|
&& (pos.pieces(PAWN) & (s + pawn_push(Us))))
|
2013-08-17 03:05:55 -06:00
|
|
|
score += MinorBehindPawn;
|
2013-08-13 06:19:42 -06:00
|
|
|
}
|
2008-08-31 23:59:13 -06:00
|
|
|
|
Remove QueenOn7th and QueenOnPawn
Small simplification.
Passed SPRT(-3,1) both at STC:
LLR: 2.95 (-2.94,2.94) [-3.00,1.00]
Total: 17051 W: 3132 L: 3005 D: 10914
and LTC:
LLR: 4.55 (-2.94,2.94) [-3.00,1.00]
Total: 24890 W: 3842 L: 3646 D: 17402
The rationale behind this is that I've never managed to add a
Queen on 7th rank bonus in DiscoCheck, because it never showed
to be positive (evne slightly) in testing. The only thing that
worked is Rook on 7th rank.
In terms of SF code, it seemed natural to group it with QueenOnPawn
as well as those are done together. I know you're against groupping
in general, but when it comes to non regression test, you are being
more conservative by groupping. If the group passes SPRT(-3,1) it's
safer to commit, than test every component in SPRT(-3,1) and end up
with the risk of commiting several -1 elo regression instead of just
one -1 elo regression.
In chess terms, perhaps it's just easier to manouver a Queen (which
can more also diagonaly) than a Rook. Therefore you can let the search
do its job without needing eval ad-hoc terms to guide it. For the Rook
which takes more moves to manouver such eval terms can be (marginally)
useful.
bench: 7473314
2014-04-03 07:31:42 -06:00
|
|
|
if (Pt == ROOK)
|
2009-03-06 08:29:46 -07:00
|
|
|
{
|
Remove QueenOn7th and QueenOnPawn
Small simplification.
Passed SPRT(-3,1) both at STC:
LLR: 2.95 (-2.94,2.94) [-3.00,1.00]
Total: 17051 W: 3132 L: 3005 D: 10914
and LTC:
LLR: 4.55 (-2.94,2.94) [-3.00,1.00]
Total: 24890 W: 3842 L: 3646 D: 17402
The rationale behind this is that I've never managed to add a
Queen on 7th rank bonus in DiscoCheck, because it never showed
to be positive (evne slightly) in testing. The only thing that
worked is Rook on 7th rank.
In terms of SF code, it seemed natural to group it with QueenOnPawn
as well as those are done together. I know you're against groupping
in general, but when it comes to non regression test, you are being
more conservative by groupping. If the group passes SPRT(-3,1) it's
safer to commit, than test every component in SPRT(-3,1) and end up
with the risk of commiting several -1 elo regression instead of just
one -1 elo regression.
In chess terms, perhaps it's just easier to manouver a Queen (which
can more also diagonaly) than a Rook. Therefore you can let the search
do its job without needing eval ad-hoc terms to guide it. For the Rook
which takes more moves to manouver such eval terms can be (marginally)
useful.
bench: 7473314
2014-04-03 07:31:42 -06:00
|
|
|
// Rook piece attacking enemy pawns on the same rank/file
|
|
|
|
if (relative_rank(Us, s) >= RANK_5)
|
|
|
|
{
|
|
|
|
Bitboard pawns = pos.pieces(Them, PAWN) & PseudoAttacks[ROOK][s];
|
|
|
|
if (pawns)
|
|
|
|
score += popcount<Max15>(pawns) * RookOnPawn;
|
|
|
|
}
|
2011-01-03 14:32:57 -07:00
|
|
|
|
2013-06-01 03:48:38 -06:00
|
|
|
// Give a bonus for a rook on a open or semi-open file
|
2014-04-13 05:35:58 -06:00
|
|
|
if (ei.pi->semiopen_file(Us, file_of(s)))
|
2014-09-20 02:19:21 -06:00
|
|
|
score += ei.pi->semiopen_file(Them, file_of(s)) ? RookOpenFile : RookSemiOpenFile;
|
2013-06-01 03:48:38 -06:00
|
|
|
|
2014-04-13 05:35:58 -06:00
|
|
|
if (mob > 3 || ei.pi->semiopen_file(Us, file_of(s)))
|
2009-03-15 10:02:09 -06:00
|
|
|
continue;
|
2008-09-24 08:45:19 -06:00
|
|
|
|
2013-05-11 01:29:02 -06:00
|
|
|
Square ksq = pos.king_square(Us);
|
2008-09-24 08:45:19 -06:00
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// Penalize rooks which are trapped by a king. Penalize more if the
|
|
|
|
// king has lost its castling capability.
|
2013-05-04 04:27:19 -06:00
|
|
|
if ( ((file_of(ksq) < FILE_E) == (file_of(s) < file_of(ksq)))
|
2013-05-14 16:06:11 -06:00
|
|
|
&& (rank_of(ksq) == rank_of(s) || relative_rank(Us, ksq) == RANK_1)
|
2014-04-13 05:35:58 -06:00
|
|
|
&& !ei.pi->semiopen_side(Us, file_of(ksq), file_of(s) < file_of(ksq)))
|
2014-07-03 05:38:54 -06:00
|
|
|
score -= (TrappedRook - make_score(mob * 22, 0)) * (1 + !pos.can_castle(Us));
|
2013-05-11 01:29:02 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// An important Chess960 pattern: A cornered bishop blocked by a friendly
|
|
|
|
// pawn diagonally in front of it is a very serious problem, especially
|
|
|
|
// when that pawn is also blocked.
|
2014-02-15 05:27:16 -07:00
|
|
|
if ( Pt == BISHOP
|
2013-05-11 01:29:02 -06:00
|
|
|
&& pos.is_chess960()
|
|
|
|
&& (s == relative_square(Us, SQ_A1) || s == relative_square(Us, SQ_H1)))
|
|
|
|
{
|
|
|
|
Square d = pawn_push(Us) + (file_of(s) == FILE_A ? DELTA_E : DELTA_W);
|
2014-02-15 05:27:16 -07:00
|
|
|
if (pos.piece_on(s + d) == make_piece(Us, PAWN))
|
|
|
|
score -= !pos.empty(s + d + pawn_push(Us)) ? TrappedBishopA1H1 * 4
|
|
|
|
: pos.piece_on(s + d + d) == make_piece(Us, PAWN) ? TrappedBishopA1H1 * 2
|
|
|
|
: TrappedBishopA1H1;
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|
2008-09-24 08:45:19 -06:00
|
|
|
}
|
2011-02-26 06:09:58 -07:00
|
|
|
|
|
|
|
if (Trace)
|
2014-10-11 01:52:16 -06:00
|
|
|
Tracing::write(Pt, Us, score);
|
2011-02-26 06:09:58 -07:00
|
|
|
|
2014-04-10 11:45:18 -06:00
|
|
|
return score - evaluate_pieces<NextPt, Them, Trace>(pos, ei, mobility, mobilityArea);
|
2009-09-28 03:46:55 -06:00
|
|
|
}
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2014-04-10 11:45:18 -06:00
|
|
|
template<>
|
|
|
|
Score evaluate_pieces<KING, WHITE, false>(const Position&, EvalInfo&, Score*, Bitboard*) { return SCORE_ZERO; }
|
|
|
|
template<>
|
|
|
|
Score evaluate_pieces<KING, WHITE, true>(const Position&, EvalInfo&, Score*, Bitboard*) { return SCORE_ZERO; }
|
|
|
|
|
2009-09-28 05:27:05 -06:00
|
|
|
|
2013-10-18 09:42:52 -06:00
|
|
|
// evaluate_king() assigns bonuses and penalties to a king of a given color
|
2008-09-23 16:32:53 -06:00
|
|
|
|
2011-12-30 03:30:26 -07:00
|
|
|
template<Color Us, bool Trace>
|
2013-11-08 03:42:22 -07:00
|
|
|
Score evaluate_king(const Position& pos, const EvalInfo& ei) {
|
2008-09-23 16:32:53 -06:00
|
|
|
|
2009-09-28 03:46:55 -06:00
|
|
|
const Color Them = (Us == WHITE ? BLACK : WHITE);
|
2009-11-12 11:01:44 -07:00
|
|
|
|
2010-05-07 01:39:28 -06:00
|
|
|
Bitboard undefended, b, b1, b2, safe;
|
2010-08-21 11:57:52 -06:00
|
|
|
int attackUnits;
|
2010-05-06 03:13:07 -06:00
|
|
|
const Square ksq = pos.king_square(Us);
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2012-03-28 04:44:41 -06:00
|
|
|
// King shelter and enemy pawns storm
|
|
|
|
Score score = ei.pi->king_safety<Us>(pos, ksq);
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2013-10-18 09:42:52 -06:00
|
|
|
// Main king safety evaluation
|
2013-12-22 04:00:09 -07:00
|
|
|
if (ei.kingAttackersCount[Them])
|
2008-09-25 08:43:37 -06:00
|
|
|
{
|
2013-12-02 11:04:09 -07:00
|
|
|
// Find the attacked squares around the king which have no defenders
|
2010-05-06 12:10:04 -06:00
|
|
|
// apart from the king itself
|
2013-10-18 09:42:52 -06:00
|
|
|
undefended = ei.attackedBy[Them][ALL_PIECES]
|
|
|
|
& ei.attackedBy[Us][KING]
|
|
|
|
& ~( ei.attackedBy[Us][PAWN] | ei.attackedBy[Us][KNIGHT]
|
2010-08-25 07:28:08 -06:00
|
|
|
| ei.attackedBy[Us][BISHOP] | ei.attackedBy[Us][ROOK]
|
|
|
|
| ei.attackedBy[Us][QUEEN]);
|
2010-05-06 12:10:04 -06:00
|
|
|
|
|
|
|
// Initialize the 'attackUnits' variable, which is used later on as an
|
2013-06-01 03:48:38 -06:00
|
|
|
// index to the KingDanger[] array. The initial value is based on the
|
|
|
|
// number and types of the enemy's attacking pieces, the number of
|
2013-12-30 00:13:39 -07:00
|
|
|
// attacked and undefended squares around our king and the quality of
|
|
|
|
// the pawn shelter (current 'score' value).
|
2013-10-12 04:59:43 -06:00
|
|
|
attackUnits = std::min(20, (ei.kingAttackersCount[Them] * ei.kingAttackersWeight[Them]) / 2)
|
2011-12-31 01:46:43 -07:00
|
|
|
+ 3 * (ei.kingAdjacentZoneAttacksCount[Them] + popcount<Max15>(undefended))
|
2014-04-01 03:58:10 -06:00
|
|
|
+ 2 * (ei.pinnedPieces[Us] != 0)
|
2014-09-21 11:32:47 -06:00
|
|
|
- mg_value(score) / 32
|
|
|
|
- !pos.count<QUEEN>(Them) * 15;
|
2010-05-06 12:10:04 -06:00
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// Analyse the enemy's safe queen contact checks. Firstly, find the
|
|
|
|
// undefended squares around the king that are attacked by the enemy's
|
|
|
|
// queen...
|
2011-06-28 07:36:39 -06:00
|
|
|
b = undefended & ei.attackedBy[Them][QUEEN] & ~pos.pieces(Them);
|
2008-09-25 08:43:37 -06:00
|
|
|
if (b)
|
|
|
|
{
|
2013-12-02 11:04:09 -07:00
|
|
|
// ...and then remove squares not supported by another enemy piece
|
2010-08-25 07:28:08 -06:00
|
|
|
b &= ( ei.attackedBy[Them][PAWN] | ei.attackedBy[Them][KNIGHT]
|
|
|
|
| ei.attackedBy[Them][BISHOP] | ei.attackedBy[Them][ROOK]);
|
2014-02-15 05:27:16 -07:00
|
|
|
|
2010-05-06 12:10:04 -06:00
|
|
|
if (b)
|
2014-06-03 06:48:43 -06:00
|
|
|
attackUnits += QueenContactCheck * popcount<Max15>(b);
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|
2008-12-22 04:07:00 -07:00
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// Analyse the enemy's safe rook contact checks. Firstly, find the
|
|
|
|
// undefended squares around the king that are attacked by the enemy's
|
|
|
|
// rooks...
|
2011-06-28 07:36:39 -06:00
|
|
|
b = undefended & ei.attackedBy[Them][ROOK] & ~pos.pieces(Them);
|
2010-09-12 04:39:38 -06:00
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// Consider only squares where the enemy's rook gives check
|
2012-01-09 01:48:27 -07:00
|
|
|
b &= PseudoAttacks[ROOK][ksq];
|
2010-09-12 04:39:38 -06:00
|
|
|
|
|
|
|
if (b)
|
|
|
|
{
|
2013-12-02 11:04:09 -07:00
|
|
|
// ...and then remove squares not supported by another enemy piece
|
2010-09-12 04:39:38 -06:00
|
|
|
b &= ( ei.attackedBy[Them][PAWN] | ei.attackedBy[Them][KNIGHT]
|
|
|
|
| ei.attackedBy[Them][BISHOP] | ei.attackedBy[Them][QUEEN]);
|
2014-02-15 05:27:16 -07:00
|
|
|
|
2010-09-12 04:39:38 -06:00
|
|
|
if (b)
|
2014-06-03 06:48:43 -06:00
|
|
|
attackUnits += RookContactCheck * popcount<Max15>(b);
|
2010-09-12 04:39:38 -06:00
|
|
|
}
|
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// Analyse the enemy's safe distance checks for sliders and knights
|
2013-03-20 23:07:25 -06:00
|
|
|
safe = ~(pos.pieces(Them) | ei.attackedBy[Us][ALL_PIECES]);
|
2010-05-06 12:10:04 -06:00
|
|
|
|
|
|
|
b1 = pos.attacks_from<ROOK>(ksq) & safe;
|
|
|
|
b2 = pos.attacks_from<BISHOP>(ksq) & safe;
|
|
|
|
|
2010-05-07 01:39:28 -06:00
|
|
|
// Enemy queen safe checks
|
2010-08-25 07:28:08 -06:00
|
|
|
b = (b1 | b2) & ei.attackedBy[Them][QUEEN];
|
2010-05-07 01:39:28 -06:00
|
|
|
if (b)
|
2013-06-01 03:48:38 -06:00
|
|
|
attackUnits += QueenCheck * popcount<Max15>(b);
|
2010-05-07 01:39:28 -06:00
|
|
|
|
2010-05-06 12:10:04 -06:00
|
|
|
// Enemy rooks safe checks
|
2010-08-25 07:28:08 -06:00
|
|
|
b = b1 & ei.attackedBy[Them][ROOK];
|
2010-05-06 12:10:04 -06:00
|
|
|
if (b)
|
2013-06-01 03:48:38 -06:00
|
|
|
attackUnits += RookCheck * popcount<Max15>(b);
|
2010-05-06 12:10:04 -06:00
|
|
|
|
|
|
|
// Enemy bishops safe checks
|
2010-08-25 07:28:08 -06:00
|
|
|
b = b2 & ei.attackedBy[Them][BISHOP];
|
2010-05-06 12:10:04 -06:00
|
|
|
if (b)
|
2013-06-01 03:48:38 -06:00
|
|
|
attackUnits += BishopCheck * popcount<Max15>(b);
|
2010-05-06 12:10:04 -06:00
|
|
|
|
|
|
|
// Enemy knights safe checks
|
2010-08-25 07:28:08 -06:00
|
|
|
b = pos.attacks_from<KNIGHT>(ksq) & ei.attackedBy[Them][KNIGHT] & safe;
|
2010-05-06 12:10:04 -06:00
|
|
|
if (b)
|
2013-06-01 03:48:38 -06:00
|
|
|
attackUnits += KnightCheck * popcount<Max15>(b);
|
2010-05-06 12:10:04 -06:00
|
|
|
|
2013-06-01 03:48:38 -06:00
|
|
|
// To index KingDanger[] attackUnits must be in [0, 99] range
|
2011-10-30 22:38:44 -06:00
|
|
|
attackUnits = std::min(99, std::max(0, attackUnits));
|
2010-05-06 12:10:04 -06:00
|
|
|
|
2013-06-01 03:48:38 -06:00
|
|
|
// Finally, extract the king danger score from the KingDanger[]
|
2013-11-08 03:42:22 -07:00
|
|
|
// array and subtract the score from evaluation.
|
2014-06-03 06:48:43 -06:00
|
|
|
score -= KingDanger[attackUnits];
|
2010-08-25 13:16:27 -06:00
|
|
|
}
|
2011-02-26 06:09:58 -07:00
|
|
|
|
|
|
|
if (Trace)
|
2014-10-11 01:52:16 -06:00
|
|
|
Tracing::write(KING, Us, score);
|
2011-02-26 06:09:58 -07:00
|
|
|
|
2011-05-02 01:43:16 -06:00
|
|
|
return score;
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|
|
|
|
|
2014-10-23 11:10:11 -06:00
|
|
|
|
2013-10-18 09:42:52 -06:00
|
|
|
// evaluate_threats() assigns bonuses according to the type of attacking piece
|
|
|
|
// and the type of attacked one.
|
|
|
|
|
|
|
|
template<Color Us, bool Trace>
|
|
|
|
Score evaluate_threats(const Position& pos, const EvalInfo& ei) {
|
|
|
|
|
|
|
|
const Color Them = (Us == WHITE ? BLACK : WHITE);
|
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
enum { Defended, Weak };
|
|
|
|
enum { Minor, Major };
|
|
|
|
|
|
|
|
Bitboard b, weak, defended;
|
2013-10-18 09:42:52 -06:00
|
|
|
Score score = SCORE_ZERO;
|
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
// Non-pawn enemies defended by a pawn and under our attack
|
|
|
|
defended = (pos.pieces(Them) ^ pos.pieces(Them, PAWN))
|
|
|
|
& ei.attackedBy[Them][PAWN]
|
|
|
|
& (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP] | ei.attackedBy[Us][ROOK]);
|
2014-06-30 08:55:10 -06:00
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
// Add a bonus according to the kind of attacking pieces
|
|
|
|
if (defended)
|
2014-11-04 08:40:37 -07:00
|
|
|
{
|
2014-11-09 01:24:06 -07:00
|
|
|
b = defended & (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP]);
|
2014-11-04 08:40:37 -07:00
|
|
|
while (b)
|
2014-11-09 01:24:06 -07:00
|
|
|
score += Threat[Defended][Minor][type_of(pos.piece_on(pop_lsb(&b)))];
|
2014-11-04 08:40:37 -07:00
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
b = defended & (ei.attackedBy[Us][ROOK]);
|
2014-11-04 08:40:37 -07:00
|
|
|
while (b)
|
2014-11-09 01:24:06 -07:00
|
|
|
score += Threat[Defended][Major][type_of(pos.piece_on(pop_lsb(&b)))];
|
2014-11-04 08:40:37 -07:00
|
|
|
}
|
2014-06-30 08:55:10 -06:00
|
|
|
|
2014-04-26 17:35:46 -06:00
|
|
|
// Enemies not defended by a pawn and under our attack
|
2014-11-09 01:24:06 -07:00
|
|
|
weak = pos.pieces(Them)
|
|
|
|
& ~ei.attackedBy[Them][PAWN]
|
|
|
|
& ei.attackedBy[Us][ALL_PIECES];
|
2013-10-18 09:42:52 -06:00
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
// Add a bonus according to the kind of attacking pieces
|
|
|
|
if (weak)
|
2013-12-18 12:00:01 -07:00
|
|
|
{
|
2014-11-09 01:24:06 -07:00
|
|
|
b = weak & (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP]);
|
2014-11-04 08:40:37 -07:00
|
|
|
while (b)
|
2014-11-09 01:24:06 -07:00
|
|
|
score += Threat[Weak][Minor][type_of(pos.piece_on(pop_lsb(&b)))];
|
2013-12-18 12:00:01 -07:00
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
b = weak & (ei.attackedBy[Us][ROOK] | ei.attackedBy[Us][QUEEN]);
|
2014-11-04 08:40:37 -07:00
|
|
|
while (b)
|
2014-11-09 01:24:06 -07:00
|
|
|
score += Threat[Weak][Major][type_of(pos.piece_on(pop_lsb(&b)))];
|
2014-04-26 17:35:46 -06:00
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
b = weak & ~ei.attackedBy[Them][ALL_PIECES];
|
2014-04-26 17:35:46 -06:00
|
|
|
if (b)
|
2014-06-03 06:48:43 -06:00
|
|
|
score += more_than_one(b) ? Hanging * popcount<Max15>(b) : Hanging;
|
2014-09-19 08:33:42 -06:00
|
|
|
|
2014-11-09 01:24:06 -07:00
|
|
|
b = weak & ei.attackedBy[Us][KING];
|
2014-09-19 08:33:42 -06:00
|
|
|
if (b)
|
2014-10-03 13:54:12 -06:00
|
|
|
score += more_than_one(b) ? KingOnMany : KingOnOne;
|
2014-09-21 11:27:34 -06:00
|
|
|
}
|
2013-10-18 09:42:52 -06:00
|
|
|
|
|
|
|
if (Trace)
|
2014-10-11 01:52:16 -06:00
|
|
|
Tracing::write(Tracing::THREAT, Us, score);
|
2013-10-18 09:42:52 -06:00
|
|
|
|
|
|
|
return score;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// evaluate_passed_pawns() evaluates the passed pawns of the given color
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2013-05-25 03:57:18 -06:00
|
|
|
template<Color Us, bool Trace>
|
2013-08-16 01:57:16 -06:00
|
|
|
Score evaluate_passed_pawns(const Position& pos, const EvalInfo& ei) {
|
2009-01-06 07:49:33 -07:00
|
|
|
|
2009-10-10 03:31:43 -06:00
|
|
|
const Color Them = (Us == WHITE ? BLACK : WHITE);
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2014-04-17 00:43:40 -06:00
|
|
|
Bitboard b, squaresToQueen, defendedSquares, unsafeSquares;
|
2011-05-02 01:43:16 -06:00
|
|
|
Score score = SCORE_ZERO;
|
|
|
|
|
|
|
|
b = ei.pi->passed_pawns(Us);
|
2009-10-10 03:31:43 -06:00
|
|
|
|
2013-05-25 03:57:18 -06:00
|
|
|
while (b)
|
|
|
|
{
|
2012-07-08 01:30:37 -06:00
|
|
|
Square s = pop_lsb(&b);
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2013-09-28 06:43:50 -06:00
|
|
|
assert(pos.pawn_passed(Us, s));
|
2009-01-06 07:49:33 -07:00
|
|
|
|
2014-04-27 04:02:36 -06:00
|
|
|
int r = relative_rank(Us, s) - RANK_2;
|
|
|
|
int rr = r * (r - 1);
|
2009-01-06 07:49:33 -07:00
|
|
|
|
2009-10-10 03:31:43 -06:00
|
|
|
// Base bonus based on rank
|
2014-04-27 02:13:59 -06:00
|
|
|
Value mbonus = Value(17 * rr), ebonus = Value(7 * (rr + r + 1));
|
2009-01-06 07:49:33 -07:00
|
|
|
|
2010-08-26 00:27:57 -06:00
|
|
|
if (rr)
|
2009-10-10 03:31:43 -06:00
|
|
|
{
|
2009-10-11 03:12:53 -06:00
|
|
|
Square blockSq = s + pawn_push(Us);
|
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// Adjust bonus based on the king's proximity
|
2014-11-08 06:04:14 -07:00
|
|
|
ebonus += distance(pos.king_square(Them), blockSq) * 5 * rr
|
|
|
|
- distance(pos.king_square(Us ), blockSq) * 2 * rr;
|
2011-04-30 06:02:56 -06:00
|
|
|
|
|
|
|
// If blockSq is not the queening square then consider also a second push
|
2013-09-09 13:12:15 -06:00
|
|
|
if (relative_rank(Us, blockSq) != RANK_8)
|
2014-11-08 06:04:14 -07:00
|
|
|
ebonus -= distance(pos.king_square(Us), blockSq + pawn_push(Us)) * rr;
|
2009-01-06 07:49:33 -07:00
|
|
|
|
2013-12-02 11:04:09 -07:00
|
|
|
// If the pawn is free to advance, then increase the bonus
|
2013-09-28 06:43:50 -06:00
|
|
|
if (pos.empty(blockSq))
|
2009-01-06 07:49:33 -07:00
|
|
|
{
|
2014-07-14 07:15:07 -06:00
|
|
|
// If there is a rook or queen attacking/defending the pawn from behind,
|
|
|
|
// consider all the squaresToQueen. Otherwise consider only the squares
|
|
|
|
// in the pawn's path attacked or occupied by the enemy.
|
|
|
|
defendedSquares = unsafeSquares = squaresToQueen = forward_bb(Us, s);
|
|
|
|
|
|
|
|
Bitboard bb = forward_bb(Them, s) & pos.pieces(ROOK, QUEEN) & pos.attacks_from<ROOK>(s);
|
|
|
|
|
|
|
|
if (!(pos.pieces(Us) & bb))
|
|
|
|
defendedSquares &= ei.attackedBy[Us][ALL_PIECES];
|
|
|
|
|
|
|
|
if (!(pos.pieces(Them) & bb))
|
|
|
|
unsafeSquares &= ei.attackedBy[Them][ALL_PIECES] | pos.pieces(Them);
|
2013-08-22 08:19:58 -06:00
|
|
|
|
2014-04-17 22:41:22 -06:00
|
|
|
// If there aren't any enemy attacks, assign a big bonus. Otherwise
|
|
|
|
// assign a smaller bonus if the block square isn't attacked.
|
|
|
|
int k = !unsafeSquares ? 15 : !(unsafeSquares & blockSq) ? 9 : 0;
|
|
|
|
|
|
|
|
// If the path to queen is fully defended, assign a big bonus.
|
|
|
|
// Otherwise assign a smaller bonus if the block square is defended.
|
2013-05-08 15:06:21 -06:00
|
|
|
if (defendedSquares == squaresToQueen)
|
|
|
|
k += 6;
|
2013-05-05 11:12:04 -06:00
|
|
|
|
2013-05-08 15:06:21 -06:00
|
|
|
else if (defendedSquares & blockSq)
|
2014-04-17 22:41:22 -06:00
|
|
|
k += 4;
|
2013-05-05 11:12:04 -06:00
|
|
|
|
2014-04-27 02:13:59 -06:00
|
|
|
mbonus += k * rr, ebonus += k * rr;
|
2009-01-06 07:49:33 -07:00
|
|
|
}
|
2014-09-30 01:05:20 -06:00
|
|
|
else if (pos.pieces(Us) & blockSq)
|
2014-07-14 04:26:25 -06:00
|
|
|
mbonus += rr * 3 + r * 2 + 3, ebonus += rr + r * 2;
|
2010-08-26 00:27:57 -06:00
|
|
|
} // rr != 0
|
2009-10-10 03:31:43 -06:00
|
|
|
|
2013-10-22 09:27:58 -06:00
|
|
|
if (pos.count<PAWN>(Us) < pos.count<PAWN>(Them))
|
2013-09-12 07:20:53 -06:00
|
|
|
ebonus += ebonus / 4;
|
|
|
|
|
2011-05-02 01:43:16 -06:00
|
|
|
score += make_score(mbonus, ebonus);
|
2013-05-25 03:57:18 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
if (Trace)
|
2014-10-11 01:52:16 -06:00
|
|
|
Tracing::write(Tracing::PASSED, Us, apply_weight(score, Weights[PassedPawns]));
|
2009-10-10 03:31:43 -06:00
|
|
|
|
2013-12-04 23:18:12 -07:00
|
|
|
// Add the scores to the middlegame and endgame eval
|
2011-05-02 01:43:16 -06:00
|
|
|
return apply_weight(score, Weights[PassedPawns]);
|
2009-10-10 03:31:43 -06:00
|
|
|
}
|
|
|
|
|
2011-05-01 00:11:58 -06:00
|
|
|
|
2014-10-06 05:26:30 -06:00
|
|
|
// evaluate_unstoppable_pawns() scores the most advanced passed pawn. In case
|
|
|
|
// both players have no pieces but pawns, this is somewhat related to the
|
|
|
|
// possibility that pawns are unstoppable.
|
2011-05-01 00:11:58 -06:00
|
|
|
|
2014-06-16 04:32:11 -06:00
|
|
|
Score evaluate_unstoppable_pawns(Color us, const EvalInfo& ei) {
|
2010-11-13 09:42:12 -07:00
|
|
|
|
2014-10-06 05:26:30 -06:00
|
|
|
Bitboard b = ei.pi->passed_pawns(us);
|
2011-05-01 00:11:58 -06:00
|
|
|
|
2014-06-16 04:32:11 -06:00
|
|
|
return b ? Unstoppable * int(relative_rank(us, frontmost_sq(us, b))) : SCORE_ZERO;
|
2010-11-13 09:42:12 -07:00
|
|
|
}
|
|
|
|
|
2009-10-10 03:31:43 -06:00
|
|
|
|
2008-12-21 08:26:36 -07:00
|
|
|
// evaluate_space() computes the space evaluation for a given side. The
|
|
|
|
// space evaluation is a simple bonus based on the number of safe squares
|
|
|
|
// available for minor pieces on the central four files on ranks 2--4. Safe
|
|
|
|
// squares one, two or three squares behind a friendly pawn are counted
|
|
|
|
// twice. Finally, the space bonus is scaled by a weight taken from the
|
2010-08-26 00:27:57 -06:00
|
|
|
// material hash table. The aim is to improve play on game opening.
|
2011-12-30 03:30:26 -07:00
|
|
|
template<Color Us>
|
2013-08-16 01:57:16 -06:00
|
|
|
int evaluate_space(const Position& pos, const EvalInfo& ei) {
|
2008-12-21 08:26:36 -07:00
|
|
|
|
2014-04-21 12:54:55 -06:00
|
|
|
const Color Them = (Us == WHITE ? BLACK : WHITE);
|
2008-12-21 08:26:36 -07:00
|
|
|
|
|
|
|
// Find the safe squares for our pieces inside the area defined by
|
2010-08-26 00:27:57 -06:00
|
|
|
// SpaceMask[]. A square is unsafe if it is attacked by an enemy
|
2008-12-21 08:26:36 -07:00
|
|
|
// pawn, or if it is undefended and attacked by an enemy piece.
|
2010-06-05 11:05:29 -06:00
|
|
|
Bitboard safe = SpaceMask[Us]
|
2012-05-01 05:01:38 -06:00
|
|
|
& ~pos.pieces(Us, PAWN)
|
2010-08-25 07:28:08 -06:00
|
|
|
& ~ei.attackedBy[Them][PAWN]
|
2013-03-20 23:07:25 -06:00
|
|
|
& (ei.attackedBy[Us][ALL_PIECES] | ~ei.attackedBy[Them][ALL_PIECES]);
|
2008-12-21 08:26:36 -07:00
|
|
|
|
2010-05-11 02:07:17 -06:00
|
|
|
// Find all squares which are at most three squares behind some friendly pawn
|
2012-05-01 05:01:38 -06:00
|
|
|
Bitboard behind = pos.pieces(Us, PAWN);
|
2014-04-21 12:54:55 -06:00
|
|
|
behind |= (Us == WHITE ? behind >> 8 : behind << 8);
|
|
|
|
behind |= (Us == WHITE ? behind >> 16 : behind << 16);
|
2008-12-21 08:26:36 -07:00
|
|
|
|
2012-12-31 03:26:12 -07:00
|
|
|
// Since SpaceMask[Us] is fully on our half of the board
|
|
|
|
assert(unsigned(safe >> (Us == WHITE ? 32 : 0)) == 0);
|
|
|
|
|
|
|
|
// Count safe + (behind & safe) with a single popcount
|
|
|
|
return popcount<Full>((Us == WHITE ? safe << 32 : safe >> 32) | (behind & safe));
|
2008-12-21 08:26:36 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-04-12 00:32:52 -06:00
|
|
|
// do_evaluate() is the evaluation entry point, called directly from evaluate()
|
2009-03-15 09:44:12 -06:00
|
|
|
|
2014-04-12 00:32:52 -06:00
|
|
|
template<bool Trace>
|
|
|
|
Value do_evaluate(const Position& pos) {
|
2009-03-15 09:44:12 -06:00
|
|
|
|
2014-04-12 00:32:52 -06:00
|
|
|
assert(!pos.checkers());
|
2009-03-15 09:44:12 -06:00
|
|
|
|
2014-04-12 00:32:52 -06:00
|
|
|
EvalInfo ei;
|
|
|
|
Score score, mobility[2] = { SCORE_ZERO, SCORE_ZERO };
|
|
|
|
Thread* thisThread = pos.this_thread();
|
|
|
|
|
|
|
|
// Initialize score by reading the incrementally updated scores included
|
2014-06-03 06:48:43 -06:00
|
|
|
// in the position object (material + piece square tables).
|
|
|
|
// Score is computed from the point of view of white.
|
|
|
|
score = pos.psq_score();
|
2014-04-12 00:32:52 -06:00
|
|
|
|
|
|
|
// Probe the material hash table
|
|
|
|
ei.mi = Material::probe(pos, thisThread->materialTable, thisThread->endgames);
|
|
|
|
score += ei.mi->material_value();
|
|
|
|
|
|
|
|
// If we have a specialized evaluation function for the current material
|
|
|
|
// configuration, call it and return.
|
|
|
|
if (ei.mi->specialized_eval_exists())
|
2014-10-11 01:05:47 -06:00
|
|
|
return ei.mi->evaluate(pos) + Eval::Tempo;
|
2014-04-12 00:32:52 -06:00
|
|
|
|
|
|
|
// Probe the pawn hash table
|
|
|
|
ei.pi = Pawns::probe(pos, thisThread->pawnsTable);
|
|
|
|
score += apply_weight(ei.pi->pawns_value(), Weights[PawnStructure]);
|
|
|
|
|
|
|
|
// Initialize attack and king safety bitboards
|
|
|
|
init_eval_info<WHITE>(pos, ei);
|
|
|
|
init_eval_info<BLACK>(pos, ei);
|
|
|
|
|
|
|
|
ei.attackedBy[WHITE][ALL_PIECES] |= ei.attackedBy[WHITE][KING];
|
|
|
|
ei.attackedBy[BLACK][ALL_PIECES] |= ei.attackedBy[BLACK][KING];
|
|
|
|
|
2014-04-28 02:30:06 -06:00
|
|
|
// Do not include in mobility squares protected by enemy pawns or occupied by our pawns or king
|
2014-04-12 00:32:52 -06:00
|
|
|
Bitboard mobilityArea[] = { ~(ei.attackedBy[BLACK][PAWN] | pos.pieces(WHITE, PAWN, KING)),
|
|
|
|
~(ei.attackedBy[WHITE][PAWN] | pos.pieces(BLACK, PAWN, KING)) };
|
|
|
|
|
|
|
|
// Evaluate pieces and mobility
|
|
|
|
score += evaluate_pieces<KNIGHT, WHITE, Trace>(pos, ei, mobility, mobilityArea);
|
|
|
|
score += apply_weight(mobility[WHITE] - mobility[BLACK], Weights[Mobility]);
|
|
|
|
|
|
|
|
// Evaluate kings after all other pieces because we need complete attack
|
|
|
|
// information when computing the king safety evaluation.
|
|
|
|
score += evaluate_king<WHITE, Trace>(pos, ei)
|
|
|
|
- evaluate_king<BLACK, Trace>(pos, ei);
|
|
|
|
|
|
|
|
// Evaluate tactical threats, we need full attack information including king
|
|
|
|
score += evaluate_threats<WHITE, Trace>(pos, ei)
|
|
|
|
- evaluate_threats<BLACK, Trace>(pos, ei);
|
|
|
|
|
|
|
|
// Evaluate passed pawns, we need full attack information including king
|
|
|
|
score += evaluate_passed_pawns<WHITE, Trace>(pos, ei)
|
|
|
|
- evaluate_passed_pawns<BLACK, Trace>(pos, ei);
|
|
|
|
|
2014-06-16 04:32:11 -06:00
|
|
|
// If both sides have only pawns, score for potential unstoppable pawns
|
|
|
|
if (!pos.non_pawn_material(WHITE) && !pos.non_pawn_material(BLACK))
|
|
|
|
score += evaluate_unstoppable_pawns(WHITE, ei)
|
|
|
|
- evaluate_unstoppable_pawns(BLACK, ei);
|
2014-04-12 00:32:52 -06:00
|
|
|
|
|
|
|
// Evaluate space for both sides, only in middlegame
|
|
|
|
if (ei.mi->space_weight())
|
|
|
|
{
|
|
|
|
int s = evaluate_space<WHITE>(pos, ei) - evaluate_space<BLACK>(pos, ei);
|
|
|
|
score += apply_weight(s * ei.mi->space_weight(), Weights[Space]);
|
|
|
|
}
|
2009-03-15 09:44:12 -06:00
|
|
|
|
2014-04-12 00:32:52 -06:00
|
|
|
// Scale winning side if position is more drawish than it appears
|
2014-06-25 14:01:00 -06:00
|
|
|
Color strongSide = eg_value(score) > VALUE_DRAW ? WHITE : BLACK;
|
|
|
|
ScaleFactor sf = ei.mi->scale_factor(pos, strongSide);
|
2014-02-15 05:27:16 -07:00
|
|
|
|
2014-06-25 14:01:00 -06:00
|
|
|
// If we don't already have an unusual scale factor, check for certain
|
|
|
|
// types of endgames, and use a lower scale for those.
|
2014-04-12 00:32:52 -06:00
|
|
|
if ( ei.mi->game_phase() < PHASE_MIDGAME
|
|
|
|
&& (sf == SCALE_FACTOR_NORMAL || sf == SCALE_FACTOR_ONEPAWN))
|
|
|
|
{
|
2014-10-30 05:32:43 -06:00
|
|
|
if (pos.opposite_bishops())
|
|
|
|
{
|
|
|
|
// Endgame with opposite-colored bishops and no other pieces (ignoring pawns)
|
|
|
|
// is almost a draw, in case of KBP vs KB is even more a draw.
|
2014-06-25 14:01:00 -06:00
|
|
|
if ( pos.non_pawn_material(WHITE) == BishopValueMg
|
|
|
|
&& pos.non_pawn_material(BLACK) == BishopValueMg)
|
2014-10-30 05:32:43 -06:00
|
|
|
sf = more_than_one(pos.pieces(PAWN)) ? ScaleFactor(32) : ScaleFactor(8);
|
|
|
|
|
|
|
|
// Endgame with opposite-colored bishops, but also other pieces. Still
|
|
|
|
// a bit drawish, but not as drawish as with only the two bishops.
|
2014-06-25 14:01:00 -06:00
|
|
|
else
|
|
|
|
sf = ScaleFactor(50 * sf / SCALE_FACTOR_NORMAL);
|
2014-04-12 00:32:52 -06:00
|
|
|
}
|
2014-10-30 05:32:43 -06:00
|
|
|
// Endings where weaker side can place his king in front of the opponent's
|
|
|
|
// pawns are drawish.
|
|
|
|
else if ( abs(eg_value(score)) <= BishopValueEg
|
|
|
|
&& ei.pi->pawn_span(strongSide) <= 1
|
|
|
|
&& !pos.pawn_passed(~strongSide, pos.king_square(~strongSide)))
|
2014-11-01 15:18:15 -06:00
|
|
|
sf = ei.pi->pawn_span(strongSide) ? ScaleFactor(56) : ScaleFactor(38);
|
2014-04-12 00:32:52 -06:00
|
|
|
}
|
2009-03-15 09:44:12 -06:00
|
|
|
|
2014-04-28 09:15:16 -06:00
|
|
|
// Interpolate between a middlegame and a (scaled by 'sf') endgame score
|
2014-04-28 02:30:06 -06:00
|
|
|
Value v = mg_value(score) * int(ei.mi->game_phase())
|
2014-04-28 09:15:16 -06:00
|
|
|
+ eg_value(score) * int(PHASE_MIDGAME - ei.mi->game_phase()) * sf / SCALE_FACTOR_NORMAL;
|
2014-04-28 02:30:06 -06:00
|
|
|
|
2014-04-30 00:55:45 -06:00
|
|
|
v /= int(PHASE_MIDGAME);
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2014-04-12 00:32:52 -06:00
|
|
|
// In case of tracing add all single evaluation contributions for both white and black
|
|
|
|
if (Trace)
|
|
|
|
{
|
2014-10-11 01:52:16 -06:00
|
|
|
Tracing::write(Tracing::MATERIAL, pos.psq_score());
|
|
|
|
Tracing::write(Tracing::IMBALANCE, ei.mi->material_value());
|
|
|
|
Tracing::write(PAWN, ei.pi->pawns_value());
|
|
|
|
Tracing::write(Tracing::MOBILITY, apply_weight(mobility[WHITE], Weights[Mobility])
|
|
|
|
, apply_weight(mobility[BLACK], Weights[Mobility]));
|
2014-04-12 00:32:52 -06:00
|
|
|
Score w = ei.mi->space_weight() * evaluate_space<WHITE>(pos, ei);
|
|
|
|
Score b = ei.mi->space_weight() * evaluate_space<BLACK>(pos, ei);
|
2014-10-11 01:52:16 -06:00
|
|
|
Tracing::write(Tracing::SPACE, apply_weight(w, Weights[Space]), apply_weight(b, Weights[Space]));
|
|
|
|
Tracing::write(Tracing::TOTAL, score);
|
2014-04-12 00:32:52 -06:00
|
|
|
Tracing::ei = ei;
|
|
|
|
Tracing::sf = sf;
|
|
|
|
}
|
2009-01-06 07:59:08 -07:00
|
|
|
|
2014-10-11 01:05:47 -06:00
|
|
|
return (pos.side_to_move() == WHITE ? v : -v) + Eval::Tempo;
|
2009-11-07 14:21:50 -07:00
|
|
|
}
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2010-08-26 00:27:57 -06:00
|
|
|
|
2014-02-15 05:27:16 -07:00
|
|
|
// Tracing function definitions
|
2011-05-02 01:43:16 -06:00
|
|
|
|
2014-04-06 03:43:30 -06:00
|
|
|
double Tracing::to_cp(Value v) { return double(v) / PawnValueEg; }
|
2011-05-02 01:43:16 -06:00
|
|
|
|
2014-10-11 01:52:16 -06:00
|
|
|
void Tracing::write(int idx, Color c, Score s) { scores[c][idx] = s; }
|
2011-05-02 01:43:16 -06:00
|
|
|
|
2014-10-11 01:52:16 -06:00
|
|
|
void Tracing::write(int idx, Score w, Score b) {
|
|
|
|
|
|
|
|
write(idx, WHITE, w);
|
|
|
|
write(idx, BLACK, b);
|
2011-05-02 01:43:16 -06:00
|
|
|
}
|
|
|
|
|
2014-10-11 01:52:16 -06:00
|
|
|
void Tracing::print(std::stringstream& ss, const char* name, int idx) {
|
2012-03-06 02:09:37 -07:00
|
|
|
|
2014-10-11 01:52:16 -06:00
|
|
|
Score wScore = scores[WHITE][idx];
|
|
|
|
Score bScore = scores[BLACK][idx];
|
2011-02-26 06:09:58 -07:00
|
|
|
|
|
|
|
switch (idx) {
|
2014-06-08 14:30:18 -06:00
|
|
|
case MATERIAL: case IMBALANCE: case PAWN: case TOTAL:
|
|
|
|
ss << std::setw(15) << name << " | --- --- | --- --- | "
|
2014-03-30 02:11:32 -06:00
|
|
|
<< std::setw(5) << to_cp(mg_value(wScore - bScore)) << " "
|
|
|
|
<< std::setw(5) << to_cp(eg_value(wScore - bScore)) << " \n";
|
2011-02-26 06:09:58 -07:00
|
|
|
break;
|
|
|
|
default:
|
2014-06-08 14:30:18 -06:00
|
|
|
ss << std::setw(15) << name << " | " << std::noshowpos
|
2014-02-15 05:27:16 -07:00
|
|
|
<< std::setw(5) << to_cp(mg_value(wScore)) << " "
|
|
|
|
<< std::setw(5) << to_cp(eg_value(wScore)) << " | "
|
|
|
|
<< std::setw(5) << to_cp(mg_value(bScore)) << " "
|
|
|
|
<< std::setw(5) << to_cp(eg_value(bScore)) << " | "
|
2014-03-30 02:11:32 -06:00
|
|
|
<< std::setw(5) << to_cp(mg_value(wScore - bScore)) << " "
|
|
|
|
<< std::setw(5) << to_cp(eg_value(wScore - bScore)) << " \n";
|
2011-02-26 06:09:58 -07:00
|
|
|
}
|
|
|
|
}
|
2013-06-01 03:48:38 -06:00
|
|
|
|
|
|
|
std::string Tracing::do_trace(const Position& pos) {
|
|
|
|
|
2014-10-11 01:52:16 -06:00
|
|
|
std::memset(scores, 0, sizeof(scores));
|
2014-02-15 05:27:16 -07:00
|
|
|
|
|
|
|
Value v = do_evaluate<true>(pos);
|
2014-03-30 02:11:32 -06:00
|
|
|
v = pos.side_to_move() == WHITE ? v : -v; // White's point of view
|
2014-02-15 05:27:16 -07:00
|
|
|
|
|
|
|
std::stringstream ss;
|
2014-03-30 02:11:32 -06:00
|
|
|
ss << std::showpoint << std::noshowpos << std::fixed << std::setprecision(2)
|
2014-06-08 14:30:18 -06:00
|
|
|
<< " Eval term | White | Black | Total \n"
|
|
|
|
<< " | MG EG | MG EG | MG EG \n"
|
|
|
|
<< "----------------+-------------+-------------+-------------\n";
|
2014-02-15 05:27:16 -07:00
|
|
|
|
2014-10-11 01:52:16 -06:00
|
|
|
print(ss, "Material", MATERIAL);
|
|
|
|
print(ss, "Imbalance", IMBALANCE);
|
|
|
|
print(ss, "Pawns", PAWN);
|
|
|
|
print(ss, "Knights", KNIGHT);
|
|
|
|
print(ss, "Bishops", BISHOP);
|
|
|
|
print(ss, "Rooks", ROOK);
|
|
|
|
print(ss, "Queens", QUEEN);
|
|
|
|
print(ss, "Mobility", MOBILITY);
|
|
|
|
print(ss, "King safety", KING);
|
|
|
|
print(ss, "Threats", THREAT);
|
|
|
|
print(ss, "Passed pawns", PASSED);
|
|
|
|
print(ss, "Space", SPACE);
|
2014-02-15 05:27:16 -07:00
|
|
|
|
2014-06-08 14:30:18 -06:00
|
|
|
ss << "----------------+-------------+-------------+-------------\n";
|
2014-10-11 01:52:16 -06:00
|
|
|
print(ss, "Total", TOTAL);
|
2014-02-15 05:27:16 -07:00
|
|
|
|
2014-03-30 02:11:32 -06:00
|
|
|
ss << "\nTotal Evaluation: " << to_cp(v) << " (white side)\n";
|
2014-02-15 05:27:16 -07:00
|
|
|
|
|
|
|
return ss.str();
|
2013-06-01 03:48:38 -06:00
|
|
|
}
|
2014-04-12 00:32:52 -06:00
|
|
|
|
|
|
|
} // namespace
|
|
|
|
|
|
|
|
|
|
|
|
namespace Eval {
|
|
|
|
|
2014-04-12 02:17:41 -06:00
|
|
|
/// evaluate() is the main evaluation function. It returns a static evaluation
|
|
|
|
/// of the position always from the point of view of the side to move.
|
2014-04-12 00:32:52 -06:00
|
|
|
|
|
|
|
Value evaluate(const Position& pos) {
|
2014-10-11 01:05:47 -06:00
|
|
|
return do_evaluate<false>(pos);
|
2014-04-12 00:32:52 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// trace() is like evaluate(), but instead of returning a value, it returns
|
|
|
|
/// a string (suitable for outputting to stdout) that contains the detailed
|
|
|
|
/// descriptions and values of each evaluation term. It's mainly used for
|
|
|
|
/// debugging.
|
|
|
|
std::string trace(const Position& pos) {
|
|
|
|
return Tracing::do_trace(pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-11-01 14:16:29 -06:00
|
|
|
/// init() computes evaluation weights.
|
2014-04-12 00:32:52 -06:00
|
|
|
|
|
|
|
void init() {
|
|
|
|
|
2014-04-27 03:40:44 -06:00
|
|
|
const double MaxSlope = 30;
|
|
|
|
const double Peak = 1280;
|
2014-04-12 00:32:52 -06:00
|
|
|
|
|
|
|
for (int t = 0, i = 1; i < 100; ++i)
|
|
|
|
{
|
2014-04-27 04:02:36 -06:00
|
|
|
t = int(std::min(Peak, std::min(0.4 * i * i, t + MaxSlope)));
|
2014-06-03 06:48:43 -06:00
|
|
|
KingDanger[i] = apply_weight(make_score(t, 0), Weights[KingSafety]);
|
2014-04-12 00:32:52 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace Eval
|