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

Fix a few minor code style inconsistencies

Browse source 
No functional change.
This commit is contained in:
DU-jdto 2018-03-21 01:26:12 +01:00 • committed by Stéphane Nicolet
parent bd59560480
commit ed26d71354
4 changed files with 10 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/evaluate.cpp
View file

@ -289,7 +289,7 @@ namespace {
constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
constexpr Bitboard OutpostRanks = (Us == WHITE ? Rank4BB | Rank5BB | Rank6BB
: Rank5BB | Rank4BB | Rank3BB);
: Rank5BB | Rank4BB | Rank3BB);
const Square* pl = pos.squares<Pt>(Us);
Bitboard b, bb;

2
src/movegen.cpp
View file

@ -28,7 +28,7 @@ namespace {
template<CastlingRight Cr, bool Checks, bool Chess960>
ExtMove* generate_castling(const Position& pos, ExtMove* moveList, Color us) {
static constexpr bool KingSide = (Cr == WHITE_OO || Cr == BLACK_OO);
constexpr bool KingSide = (Cr == WHITE_OO || Cr == BLACK_OO);
if (pos.castling_impeded(Cr) || !pos.can_castle(Cr))
return moveList;

14
src/search.cpp
View file

@ -31,8 +31,8 @@
#include "movepick.h"
#include "position.h"
#include "search.h"
#include "timeman.h"
#include "thread.h"
#include "timeman.h"
#include "tt.h"
#include "uci.h"
#include "syzygy/tbprobe.h"
@ -689,12 +689,12 @@ namespace {
// Step 7. Razoring (skipped when in check)
if ( !PvNode
&& depth <= 2 * ONE_PLY
&& eval <= alpha - Value(RazorMargin[depth / ONE_PLY]))
&& depth < 3 * ONE_PLY
&& eval <= alpha - RazorMargin[depth / ONE_PLY])
{
Value ralpha = alpha - Value((depth != ONE_PLY) * RazorMargin[depth / ONE_PLY]);
Value ralpha = alpha - (depth >= 2 * ONE_PLY) * RazorMargin[depth / ONE_PLY];
Value v = qsearch<NonPV>(pos, ss, ralpha, ralpha+1);
if (depth == ONE_PLY || v <= ralpha)
if (depth < 2 * ONE_PLY || v <= ralpha)
return v;
}
@ -1148,7 +1148,6 @@ moves_loop: // When in check, search starts from here
Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth) {
constexpr bool PvNode = NT == PV;
const bool inCheck = bool(pos.checkers());
assert(alpha >= -VALUE_INFINITE && alpha < beta && beta <= VALUE_INFINITE);
assert(PvNode || (alpha == beta - 1));
@ -1162,7 +1161,7 @@ moves_loop: // When in check, search starts from here
Move ttMove, move, bestMove;
Depth ttDepth;
Value bestValue, value, ttValue, futilityValue, futilityBase, oldAlpha;
bool ttHit, givesCheck, evasionPrunable;
bool ttHit, inCheck, givesCheck, evasionPrunable;
int moveCount;
if (PvNode)
@ -1174,6 +1173,7 @@ moves_loop: // When in check, search starts from here
(ss+1)->ply = ss->ply + 1;
ss->currentMove = bestMove = MOVE_NONE;
inCheck = pos.checkers();
moveCount = 0;
// Check for an immediate draw or maximum ply reached

2
src/uci.cpp
View file

@ -28,8 +28,8 @@
#include "position.h"
#include "search.h"
#include "thread.h"
#include "tt.h"
#include "timeman.h"
#include "tt.h"
#include "uci.h"
#include "syzygy/tbprobe.h"