X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmaterial.cpp;h=f6c4e2d63b1d8f6e649298c77995b89003d2c835;hp=ebf5adff854abc4bb6770c6547795e72c7d791c7;hb=ace8e951d70c2986a0af83effcc0d2b2312d29e3;hpb=098f645d26675bcf2180b290be77fe64a63de3ae diff --git a/src/material.cpp b/src/material.cpp index ebf5adff..f6c4e2d6 100644 --- a/src/material.cpp +++ b/src/material.cpp @@ -2,6 +2,7 @@ Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -30,29 +31,26 @@ namespace { // Polynomial material imbalance parameters - // pair pawn knight bishop rook queen - const int Linear[6] = { 1852, -162, -1122, -183, 249, -154 }; - const int QuadraticOurs[][PIECE_TYPE_NB] = { // OUR PIECES // pair pawn knight bishop rook queen - { 0 }, // Bishop pair - { 39, 2 }, // Pawn - { 35, 271, -4 }, // Knight OUR PIECES - { 0, 105, 4, 0 }, // Bishop - { -27, -2, 46, 100, -141 }, // Rook - {-177, 25, 129, 142, -137, 0 } // Queen + {1667 }, // Bishop pair + { 40, 2 }, // Pawn + { 32, 255, -3 }, // Knight OUR PIECES + { 0, 104, 4, 0 }, // Bishop + { -26, -2, 47, 105, -149 }, // Rook + {-185, 24, 122, 137, -134, 0 } // Queen }; const int QuadraticTheirs[][PIECE_TYPE_NB] = { // THEIR PIECES // pair pawn knight bishop rook queen { 0 }, // Bishop pair - { 37, 0 }, // Pawn - { 10, 62, 0 }, // Knight OUR PIECES - { 57, 64, 39, 0 }, // Bishop - { 50, 40, 23, -22, 0 }, // Rook - { 98, 105, -39, 141, 274, 0 } // Queen + { 36, 0 }, // Pawn + { 9, 63, 0 }, // Knight OUR PIECES + { 59, 65, 42, 0 }, // Bishop + { 46, 39, 24, -24, 0 }, // Rook + { 101, 100, -37, 141, 268, 0 } // Queen }; // Endgame evaluation and scaling functions are accessed directly and not through @@ -99,7 +97,7 @@ namespace { if (!pieceCount[Us][pt1]) continue; - int v = Linear[pt1]; + int v = 0; for (int pt2 = NO_PIECE_TYPE; pt2 <= pt1; ++pt2) v += QuadraticOurs[pt1][pt2] * pieceCount[Us][pt2] @@ -199,11 +197,11 @@ Entry* probe(const Position& pos) { // drawish scale factor for cases such as KRKBP and KmmKm (except for KBBKN). if (!pos.count(WHITE) && npm_w - npm_b <= BishopValueMg) e->factor[WHITE] = uint8_t(npm_w < RookValueMg ? SCALE_FACTOR_DRAW : - npm_b <= BishopValueMg ? 4 : 12); + npm_b <= BishopValueMg ? 4 : 14); if (!pos.count(BLACK) && npm_b - npm_w <= BishopValueMg) e->factor[BLACK] = uint8_t(npm_b < RookValueMg ? SCALE_FACTOR_DRAW : - npm_w <= BishopValueMg ? 4 : 12); + npm_w <= BishopValueMg ? 4 : 14); if (pos.count(WHITE) == 1 && npm_w - npm_b <= BishopValueMg) e->factor[WHITE] = (uint8_t) SCALE_FACTOR_ONEPAWN;