kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-02 01:29:36 +00:00
Code Issues Releases Wiki Activity

Small code style triviality in evaluation

Browse source 
No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2009-05-19 15:41:45 +01:00
parent da579e46b7
commit 1e4472b651
1 changed files with 19 additions and 20 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
src/evaluate.cpp
View file

@ -39,9 +39,9 @@
namespace { namespace {
const int Sign[2] = {1, -1}; const int Sign[2] = { 1, -1 };
// Evaluation grain size, must be a power of 2. // Evaluation grain size, must be a power of 2
const int GrainSize = 4; const int GrainSize = 4;
// Evaluation weights, initialized from UCI options // Evaluation weights, initialized from UCI options
@ -175,20 +175,19 @@ namespace {
const Value MidgameQueenOn7thBonus = Value(27); const Value MidgameQueenOn7thBonus = Value(27);
const Value EndgameQueenOn7thBonus = Value(54); const Value EndgameQueenOn7thBonus = Value(54);
// Rooks on open files // Rooks on open files
const Value RookOpenFileBonus = Value(43); const Value RookOpenFileBonus = Value(43);
const Value RookHalfOpenFileBonus = Value(19); const Value RookHalfOpenFileBonus = Value(19);
// Penalty for rooks trapped inside a friendly king which has lost the // Penalty for rooks trapped inside a friendly king which has lost the
// right to castle: // right to castle.
const Value TrappedRookPenalty = Value(180); const Value TrappedRookPenalty = Value(180);
// Penalty for a bishop on a7/h7 (a2/h2 for black) which is trapped by // Penalty for a bishop on a7/h7 (a2/h2 for black) which is trapped by
// enemy pawns: // enemy pawns.
const Value TrappedBishopA7H7Penalty = Value(300); const Value TrappedBishopA7H7Penalty = Value(300);
// Bitboard masks for detecting trapped bishops on a7/h7 (a2/h2 for black): // Bitboard masks for detecting trapped bishops on a7/h7 (a2/h2 for black)
const Bitboard MaskA7H7[2] = { const Bitboard MaskA7H7[2] = {
((1ULL << SQ_A7) | (1ULL << SQ_H7)), ((1ULL << SQ_A7) | (1ULL << SQ_H7)),
((1ULL << SQ_A2) | (1ULL << SQ_H2)) ((1ULL << SQ_A2) | (1ULL << SQ_H2))
@ -199,7 +198,7 @@ namespace {
// happen in Chess960 games. // happen in Chess960 games.
const Value TrappedBishopA1H1Penalty = Value(100); const Value TrappedBishopA1H1Penalty = Value(100);
// Bitboard masks for detecting trapped bishops on a1/h1 (a8/h8 for black): // Bitboard masks for detecting trapped bishops on a1/h1 (a8/h8 for black)
const Bitboard MaskA1H1[2] = { const Bitboard MaskA1H1[2] = {
((1ULL << SQ_A1) | (1ULL << SQ_H1)), ((1ULL << SQ_A1) | (1ULL << SQ_H1)),
((1ULL << SQ_A8) | (1ULL << SQ_H8)) ((1ULL << SQ_A8) | (1ULL << SQ_H8))
@ -223,7 +222,7 @@ namespace {
/// the strength of the attack are added up into an integer, which is used /// the strength of the attack are added up into an integer, which is used
/// as an index to SafetyTable[]. /// as an index to SafetyTable[].
// Attack weights for each piece type. // Attack weights for each piece type
const int QueenAttackWeight = 5; const int QueenAttackWeight = 5;
const int RookAttackWeight = 3; const int RookAttackWeight = 3;
const int BishopAttackWeight = 2; const int BishopAttackWeight = 2;
@ -257,14 +256,14 @@ namespace {
Value SafetyTable[100]; Value SafetyTable[100];
// Pawn and material hash tables, indexed by the current thread id // Pawn and material hash tables, indexed by the current thread id
PawnInfoTable *PawnTable[8] = {0, 0, 0, 0, 0, 0, 0, 0}; PawnInfoTable* PawnTable[8] = {0, 0, 0, 0, 0, 0, 0, 0};
MaterialInfoTable *MaterialTable[8] = {0, 0, 0, 0, 0, 0, 0, 0}; MaterialInfoTable* MaterialTable[8] = {0, 0, 0, 0, 0, 0, 0, 0};
// Sizes of pawn and material hash tables // Sizes of pawn and material hash tables
const int PawnTableSize = 16384; const int PawnTableSize = 16384;
const int MaterialTableSize = 1024; const int MaterialTableSize = 1024;
// Array which gives the number of nonzero bits in an 8-bit integer: // Array which gives the number of nonzero bits in an 8-bit integer
uint8_t BitCount8Bit[256]; uint8_t BitCount8Bit[256];
// Function prototypes // Function prototypes