Skip to content

Simple Protector #1099

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
FauziAkram wants to merge 7 commits into from
Closed

Simple Protector #1099

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
174ef9d
Update evaluate.cpp
FauziAkram May 4, 2017
79d4d80
Update types.h
FauziAkram May 4, 2017
9590024
Update AUTHORS
FauziAkram May 4, 2017
9cfbc6e
Update AUTHORS
FauziAkram May 4, 2017
7a690e7
Update evaluate.cpp
FauziAkram May 4, 2017
15e47c8
Update AUTHORS
FauziAkram May 4, 2017
ad06a96
Update AUTHORS
FauziAkram May 4, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 3 additions & 10 deletions src/evaluate.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -174,14 +174,8 @@ namespace {
S(-20,-12), S( 1, -8), S( 2, 10), S( 9, 10)
};

// Protector[PieceType-2][distance] contains a protecting bonus for our king,
// indexed by piece type and distance between the piece and the king.
const Score Protector[][8] = {
{ S(0, 0), S( 7, 9), S( 7, 1), S( 1, 5), S(-10,-4), S( -1,-4), S( -7,-3), S(-16,-10) }, // Knight
{ S(0, 0), S(11, 8), S(-7,-1), S(-1,-2), S( -1,-7), S(-11,-3), S( -9,-1), S(-16, -1) }, // Bishop
{ S(0, 0), S(10, 0), S(-2, 2), S(-5, 4), S( -6, 2), S(-14,-3), S( -2,-9), S(-12, -7) }, // Rook
{ S(0, 0), S( 3,-5), S( 2,-5), S(-4, 0), S( -9,-6), S( -4, 7), S(-13,-7), S(-10, -7) } // Queen
};
// KingProtector[PieceType-2] contains distance to king factors for each piece type
const Score KingProtector[] = {S(-3, -5), S(-4, -3), S(-3, 0), S(-1, 1) };

// Assorted bonuses and penalties used by evaluation
const Score MinorBehindPawn = S( 16, 0);
Expand Down Expand Up @@ -299,8 +293,7 @@ namespace {

mobility[Us] += MobilityBonus[Pt-2][mob];

// Bonus for this piece as a king protector
score += Protector[Pt-2][distance(s, pos.square<KING>(Us))];
score += KingProtector[Pt-2] * distance(s, pos.square<KING>(Us));

if (Pt == BISHOP || Pt == KNIGHT)
{
Expand Down
8 changes: 4 additions & 4 deletions src/types.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -184,10 +184,10 @@ enum Value : int {
VALUE_MATED_IN_MAX_PLY = -VALUE_MATE + 2 * MAX_PLY,

PawnValueMg = 188, PawnValueEg = 248,
KnightValueMg = 753, KnightValueEg = 832,
BishopValueMg = 814, BishopValueEg = 890,
RookValueMg = 1285, RookValueEg = 1371,
QueenValueMg = 2513, QueenValueEg = 2648,
KnightValueMg = 764, KnightValueEg = 848,
BishopValueMg = 826, BishopValueEg = 891,
RookValueMg = 1282, RookValueEg = 1373,
QueenValueMg = 2526, QueenValueEg = 2646,

MidgameLimit = 15258, EndgameLimit = 3915
};
Expand Down