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

Code clean-up

Browse source 
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
This commit is contained in:
Stéphane Nicolet 2018-07-25 18:31:02 +02:00
parent c4c2e08f0d
commit ae98927885
2 changed files with 4 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
src/evaluate.cpp
View file

@ -551,7 +551,6 @@ namespace {
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]) if (weak & attackedBy[Us][KING])
score += ThreatByKing; score += ThreatByKing;
@ -576,7 +575,7 @@ namespace {
b = shift<Up>(pos.pieces(Us, PAWN)) & ~pos.pieces(); b = shift<Up>(pos.pieces(Us, PAWN)) & ~pos.pieces();
b |= shift<Up>(b & TRank3BB) & ~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] b &= ~attackedBy[Them][PAWN]
& (attackedBy[Us][ALL_PIECES] | ~attackedBy[Them][ALL_PIECES]); & (attackedBy[Us][ALL_PIECES] | ~attackedBy[Them][ALL_PIECES]);

6
src/misc.cpp
View file

@ -224,11 +224,11 @@ void bindThisThread(size_t) {}
#else #else
/// 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 /// API and returns the best group id for the thread with index idx. Original
/// code from Texel by Peter Österlund. /// code from Texel by Peter Österlund.
int get_group(size_t idx) { int best_group(size_t idx) {
int threads = 0; int threads = 0;
int nodes = 0; int nodes = 0;
@ -299,7 +299,7 @@ int get_group(size_t idx) {
void bindThisThread(size_t idx) { void bindThisThread(size_t idx) {
// Use only local variables to be thread-safe // Use only local variables to be thread-safe
int group = get_group(idx); int group = best_group(idx);
if (group == -1) if (group == -1)
return; return;