Skip to content

Commit

Permalink
Small cleanups
Browse files Browse the repository at this point in the history
closes #2546

No functional change.
  • Loading branch information
vondele committed Mar 1, 2020
1 parent f27339d commit c6839a2
Show file tree
Hide file tree
Showing 8 changed files with 37 additions and 41 deletions.
2 changes: 1 addition & 1 deletion src/Makefile
Expand Up @@ -409,7 +409,7 @@ help:
@echo ""


.PHONY: help build profile-build strip install clean objclean profileclean help \
.PHONY: help build profile-build strip install clean objclean profileclean \
config-sanity icc-profile-use icc-profile-make gcc-profile-use gcc-profile-make \
clang-profile-use clang-profile-make

Expand Down
2 changes: 1 addition & 1 deletion src/bitboard.h
Expand Up @@ -154,7 +154,7 @@ inline Bitboard file_bb(Square s) {
}


/// shift() moves a bitboard one step along direction D
/// shift() moves a bitboard one or two steps as specified by the direction D

template<Direction D>
constexpr Bitboard shift(Bitboard b) {
Expand Down
2 changes: 1 addition & 1 deletion src/endgame.cpp
Expand Up @@ -281,7 +281,7 @@ Value Endgame<KQKP>::operator()(const Position& pos) const {

if ( relative_rank(weakSide, pawnSq) != RANK_7
|| distance(loserKSq, pawnSq) != 1
|| !((FileABB | FileCBB | FileFBB | FileHBB) & pawnSq))
|| ((FileBBB | FileDBB | FileEBB | FileGBB) & pawnSq))
result += QueenValueEg - PawnValueEg;

return strongSide == pos.side_to_move() ? result : -result;
Expand Down
44 changes: 22 additions & 22 deletions src/evaluate.cpp
Expand Up @@ -127,25 +127,26 @@ namespace {
};

// Assorted bonuses and penalties
constexpr Score BishopPawns = S( 3, 7);
constexpr Score CorneredBishop = S( 50, 50);
constexpr Score FlankAttacks = S( 8, 0);
constexpr Score Hanging = S( 69, 36);
constexpr Score KingProtector = S( 7, 8);
constexpr Score KnightOnQueen = S( 16, 12);
constexpr Score LongDiagonalBishop = S( 45, 0);
constexpr Score MinorBehindPawn = S( 18, 3);
constexpr Score Outpost = S( 30, 21);
constexpr Score PassedFile = S( 11, 8);
constexpr Score PawnlessFlank = S( 17, 95);
constexpr Score RestrictedPiece = S( 7, 7);
constexpr Score RookOnQueenFile = S( 7, 6);
constexpr Score SliderOnQueen = S( 59, 18);
constexpr Score ThreatByKing = S( 24, 89);
constexpr Score ThreatByPawnPush = S( 48, 39);
constexpr Score ThreatBySafePawn = S(173, 94);
constexpr Score TrappedRook = S( 52, 10);
constexpr Score WeakQueen = S( 49, 15);
constexpr Score BishopPawns = S( 3, 7);
constexpr Score CorneredBishop = S( 50, 50);
constexpr Score FlankAttacks = S( 8, 0);
constexpr Score Hanging = S( 69, 36);
constexpr Score KingProtector = S( 7, 8);
constexpr Score KnightOnQueen = S( 16, 12);
constexpr Score LongDiagonalBishop = S( 45, 0);
constexpr Score MinorBehindPawn = S( 18, 3);
constexpr Score Outpost = S( 30, 21);
constexpr Score PassedFile = S( 11, 8);
constexpr Score PawnlessFlank = S( 17, 95);
constexpr Score RestrictedPiece = S( 7, 7);
constexpr Score RookOnQueenFile = S( 7, 6);
constexpr Score SliderOnQueen = S( 59, 18);
constexpr Score ThreatByKing = S( 24, 89);
constexpr Score ThreatByPawnPush = S( 48, 39);
constexpr Score ThreatBySafePawn = S(173, 94);
constexpr Score TrappedRook = S( 52, 10);
constexpr Score WeakQueen = S( 49, 15);
constexpr Score WeakQueenProtection = S( 14, 0);

#undef S

Expand Down Expand Up @@ -518,7 +519,7 @@ namespace {
score += Hanging * popcount(weak & b);

// Additional bonus if weak piece is only protected by a queen
score += make_score(14, 0) * popcount(weak & attackedBy[Them][QUEEN]);
score += WeakQueenProtection * popcount(weak & attackedBy[Them][QUEEN]);
}

// Bonus for restricting their piece moves
Expand Down Expand Up @@ -830,8 +831,7 @@ namespace {
Trace::add(TOTAL, score);
}

return (pos.side_to_move() == WHITE ? v : -v) // Side to move point of view
+ Eval::Tempo;
return (pos.side_to_move() == WHITE ? v : -v) + Tempo; // Side to move point of view
}

} // namespace
Expand Down
2 changes: 0 additions & 2 deletions src/evaluate.h
Expand Up @@ -29,8 +29,6 @@ class Position;

namespace Eval {

constexpr Value Tempo = Value(28); // Must be visible to search

std::string trace(const Position& pos);

Value evaluate(const Position& pos);
Expand Down
8 changes: 0 additions & 8 deletions src/psqt.cpp
Expand Up @@ -22,11 +22,6 @@

#include "types.h"

Value PieceValue[PHASE_NB][PIECE_NB] = {
{ VALUE_ZERO, PawnValueMg, KnightValueMg, BishopValueMg, RookValueMg, QueenValueMg },
{ VALUE_ZERO, PawnValueEg, KnightValueEg, BishopValueEg, RookValueEg, QueenValueEg }
};

namespace PSQT {

#define S(mg, eg) make_score(mg, eg)
Expand Down Expand Up @@ -112,9 +107,6 @@ void init() {

for (Piece pc = W_PAWN; pc <= W_KING; ++pc)
{
PieceValue[MG][~pc] = PieceValue[MG][pc];
PieceValue[EG][~pc] = PieceValue[EG][pc];

Score score = make_score(PieceValue[MG][pc], PieceValue[EG][pc]);

for (Square s = SQ_A1; s <= SQ_H8; ++s)
Expand Down
10 changes: 5 additions & 5 deletions src/search.cpp
Expand Up @@ -819,14 +819,14 @@ namespace {
ss->staticEval = eval = evaluate(pos) + bonus;
}
else
ss->staticEval = eval = -(ss-1)->staticEval + 2 * Eval::Tempo;
ss->staticEval = eval = -(ss-1)->staticEval + 2 * Tempo;

tte->save(posKey, VALUE_NONE, ttPv, BOUND_NONE, DEPTH_NONE, MOVE_NONE, eval);
}

// Step 7. Razoring (~1 Elo)
if ( !rootNode // The required rootNode PV handling is not available in qsearch
&& depth < 2
&& depth == 1
&& eval <= alpha - RazorMargin)
return qsearch<NT>(pos, ss, alpha, beta);

Expand Down Expand Up @@ -1434,13 +1434,13 @@ namespace {
else
ss->staticEval = bestValue =
(ss-1)->currentMove != MOVE_NULL ? evaluate(pos)
: -(ss-1)->staticEval + 2 * Eval::Tempo;
: -(ss-1)->staticEval + 2 * Tempo;

// Stand pat. Return immediately if static value is at least beta
if (bestValue >= beta)
{
if (!ttHit)
tte->save(posKey, value_to_tt(bestValue, ss->ply), pvHit, BOUND_LOWER,
tte->save(posKey, value_to_tt(bestValue, ss->ply), false, BOUND_LOWER,
DEPTH_NONE, MOVE_NONE, ss->staticEval);

return bestValue;
Expand Down Expand Up @@ -1667,7 +1667,7 @@ namespace {


// update_continuation_histories() updates histories of the move pairs formed
// by moves at ply -1, -2, and -4 with current move.
// by moves at ply -1, -2, -4, and -6 with current move.

void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {

Expand Down
8 changes: 7 additions & 1 deletion src/types.h
Expand Up @@ -186,6 +186,7 @@ enum Value : int {
BishopValueMg = 825, BishopValueEg = 915,
RookValueMg = 1276, RookValueEg = 1380,
QueenValueMg = 2538, QueenValueEg = 2682,
Tempo = 28,

MidgameLimit = 15258, EndgameLimit = 3915
};
Expand All @@ -203,7 +204,12 @@ enum Piece {
PIECE_NB = 16
};

extern Value PieceValue[PHASE_NB][PIECE_NB];
constexpr Value PieceValue[PHASE_NB][PIECE_NB] = {
{ VALUE_ZERO, PawnValueMg, KnightValueMg, BishopValueMg, RookValueMg, QueenValueMg, VALUE_ZERO, VALUE_ZERO,
VALUE_ZERO, PawnValueMg, KnightValueMg, BishopValueMg, RookValueMg, QueenValueMg, VALUE_ZERO, VALUE_ZERO },
{ VALUE_ZERO, PawnValueEg, KnightValueEg, BishopValueEg, RookValueEg, QueenValueEg, VALUE_ZERO, VALUE_ZERO,
VALUE_ZERO, PawnValueEg, KnightValueEg, BishopValueEg, RookValueEg, QueenValueEg, VALUE_ZERO, VALUE_ZERO }
};

typedef int Depth;

Expand Down

0 comments on commit c6839a2

Please sign in to comment.