1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 08:43:09 +00:00

Rename squares_aligned()

Rename to the shorter but still
clear aligned()

No functional change.
This commit is contained in:
Marco Costalba 2013-11-10 17:14:46 +01:00
parent a518d5d3ad
commit 1d18647e73
3 changed files with 5 additions and 5 deletions

View file

@ -223,10 +223,10 @@ inline Bitboard squares_of_color(Square s) {
}
/// squares_aligned() returns true if the squares s1, s2 and s3 are aligned
/// aligned() returns true if the squares s1, s2 and s3 are aligned
/// either on a straight or on a diagonal line.
inline bool squares_aligned(Square s1, Square s2, Square s3) {
inline bool aligned(Square s1, Square s2, Square s3) {
return LineBB[s1][s2] & s3;
}

View file

@ -515,7 +515,7 @@ bool Position::legal(Move m, Bitboard pinned) const {
// is moving along the ray towards or away from the king.
return !pinned
|| !(pinned & from)
|| squares_aligned(from, to_sq(m), king_square(us));
|| aligned(from, to_sq(m), king_square(us));
}
@ -658,7 +658,7 @@ bool Position::gives_check(Move m, const CheckInfo& ci) const {
{
// For pawn and king moves we need to verify also direction
if ( (pt != PAWN && pt != KING)
|| !squares_aligned(from, to, king_square(~sideToMove)))
|| !aligned(from, to, king_square(~sideToMove)))
return true;
}

View file

@ -1331,7 +1331,7 @@ moves_loop: // When in check and at SpNode search starts from here
// We exclude the trivial case where a sliding piece does in two moves what
// it could do in one move: eg. Ra1a2, Ra2a3.
if ( m2to == m1from
|| (m1to == m2from && !squares_aligned(m1from, m2from, m2to)))
|| (m1to == m2from && !aligned(m1from, m2from, m2to)))
return true;
// Second one moves through the square vacated by first one