This patch implements some idea by Alain Savard and Mike Whiteley taken from the perpertual renaming/reformatting thread.
This is a pure code cleaning patch (so no change in functionality), but I use it as a pretext to correct the bogus bench number that I introduced in the previous commit.
Bench:
4413383
score += ThreatByRank * (int)relative_rank(Them, s);
}
score += ThreatByRank * (int)relative_rank(Them, s);
}
- // Bonus for king attacks on pawns or pieces which are not pawn-defended
if (weak & attackedBy[Us][KING])
score += ThreatByKing;
if (weak & attackedBy[Us][KING])
score += ThreatByKing;
b = shift<Up>(pos.pieces(Us, PAWN)) & ~pos.pieces();
b |= shift<Up>(b & TRank3BB) & ~pos.pieces();
b = shift<Up>(pos.pieces(Us, PAWN)) & ~pos.pieces();
b |= shift<Up>(b & TRank3BB) & ~pos.pieces();
- // Keep only the squares which are not completely unsafe
+ // Keep only the squares which are relatively safe
b &= ~attackedBy[Them][PAWN]
& (attackedBy[Us][ALL_PIECES] | ~attackedBy[Them][ALL_PIECES]);
b &= ~attackedBy[Them][PAWN]
& (attackedBy[Us][ALL_PIECES] | ~attackedBy[Them][ALL_PIECES]);
-/// get_group() retrieves logical processor information using Windows specific
+/// best_group() retrieves logical processor information using Windows specific
/// API and returns the best group id for the thread with index idx. Original
/// code from Texel by Peter Österlund.
/// API and returns the best group id for the thread with index idx. Original
/// code from Texel by Peter Österlund.
-int get_group(size_t idx) {
+int best_group(size_t idx) {
int threads = 0;
int nodes = 0;
int threads = 0;
int nodes = 0;
void bindThisThread(size_t idx) {
// Use only local variables to be thread-safe
void bindThisThread(size_t idx) {
// Use only local variables to be thread-safe
- int group = get_group(idx);
+ int group = best_group(idx);