kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 08:43:09 +00:00
Code Issues Releases Wiki Activity

Fix Intel compiler warnings

Browse source 
Fallout from previous patch: Intel compiler
is very noisy.

No functional change.
This commit is contained in:
Marco Costalba 2014-04-27 12:02:36 +02:00
parent 86c20416c8
commit 93e3b06fe2
4 changed files with 8 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
src/evaluate.cpp
View file

@ -583,8 +583,8 @@ namespace {
assert(pos.pawn_passed(Us, s)); assert(pos.pawn_passed(Us, s));
Rank r = relative_rank(Us, s) - RANK_2; int r = relative_rank(Us, s) - RANK_2;
Rank rr = r * (r - 1); int rr = r * (r - 1);
// Base bonus based on rank // Base bonus based on rank
Value mbonus = Value(17 * rr), ebonus = Value(7 * (rr + r + 1)); Value mbonus = Value(17 * rr), ebonus = Value(7 * (rr + r + 1));
@ -599,7 +599,7 @@ namespace {
// If blockSq is not the queening square then consider also a second push // If blockSq is not the queening square then consider also a second push
if (relative_rank(Us, blockSq) != RANK_8) if (relative_rank(Us, blockSq) != RANK_8)
ebonus -= rr * square_distance(pos.king_square(Us), blockSq + pawn_push(Us)); ebonus -= square_distance(pos.king_square(Us), blockSq + pawn_push(Us)) * rr;
// If the pawn is free to advance, then increase the bonus // If the pawn is free to advance, then increase the bonus
if (pos.empty(blockSq)) if (pos.empty(blockSq))
@ -920,7 +920,7 @@ namespace Eval {
for (int t = 0, i = 1; i < 100; ++i) for (int t = 0, i = 1; i < 100; ++i)
{ {
t = std::min(Peak, std::min(0.4 * i * i, t + MaxSlope)); t = int(std::min(Peak, std::min(0.4 * i * i, t + MaxSlope)));
KingDanger[1][i] = apply_weight(make_score(t, 0), Weights[KingDangerUs]); KingDanger[1][i] = apply_weight(make_score(t, 0), Weights[KingDangerUs]);
KingDanger[0][i] = apply_weight(make_score(t, 0), Weights[KingDangerThem]); KingDanger[0][i] = apply_weight(make_score(t, 0), Weights[KingDangerThem]);

4
src/search.cpp
View file

@ -146,8 +146,8 @@ void Search::init() {
// Init futility move count array // Init futility move count array
for (d = 0; d < 32; ++d) for (d = 0; d < 32; ++d)
{ {
FutilityMoveCounts[0][d] = 2.4 + 0.222 * pow(d + 0.00, 1.8); FutilityMoveCounts[0][d] = int(2.4 + 0.222 * pow(d + 0.00, 1.8));
FutilityMoveCounts[1][d] = 3.0 + 0.300 * pow(d + 0.98, 1.8); FutilityMoveCounts[1][d] = int(3.0 + 0.300 * pow(d + 0.98, 1.8));
} }
} }

2
src/timeman.cpp
View file

@ -63,7 +63,7 @@ namespace {
double ratio1 = (TMaxRatio * thisMoveImportance) / (TMaxRatio * thisMoveImportance + otherMovesImportance); double ratio1 = (TMaxRatio * thisMoveImportance) / (TMaxRatio * thisMoveImportance + otherMovesImportance);
double ratio2 = (thisMoveImportance + TStealRatio * otherMovesImportance) / (thisMoveImportance + otherMovesImportance); double ratio2 = (thisMoveImportance + TStealRatio * otherMovesImportance) / (thisMoveImportance + otherMovesImportance);
return floor(myTime * std::min(ratio1, ratio2)); return int(floor(myTime * std::min(ratio1, ratio2)));
} }
} // namespace } // namespace

2
src/timeman.h
View file

@ -27,7 +27,7 @@ class TimeManager {
public: public:
void init(const Search::LimitsType& limits, int currentPly, Color us); void init(const Search::LimitsType& limits, int currentPly, Color us);
void pv_instability(double bestMoveChanges) { unstablePvFactor = 1 + bestMoveChanges; } void pv_instability(double bestMoveChanges) { unstablePvFactor = 1 + bestMoveChanges; }
int available_time() const { return optimumSearchTime * unstablePvFactor * 0.71; } int available_time() const { return int(optimumSearchTime * unstablePvFactor * 0.71); }
int maximum_time() const { return maximumSearchTime; } int maximum_time() const { return maximumSearchTime; }
private: private: