HCha/Stockfish
1
0
Fork 0
mirror of https://github.com/HChaZZY/Stockfish.git synced 2025-12-17 23:56:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

Rename attacks_to() in attackers_to()

Browse Source 
These functions return bitboard of attacking pieces,
not the attacks themselfs so reflect this in the name.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba
2009-09-20 09:31:48 +01:00
parent 049139d025
commit 0e0adfe2e1
4 changed files with 21 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/movegen.cpp
View File

@@ -235,7 +235,7 @@ MoveStack* generate_evasions(const Position& pos, MoveStack* mlist, Bitboard pin
// Find squares attacked by slider checkers, we will
// remove them from king evasions set so to avoid a couple
// of cycles in the slow king evasions legality check loop
// and to be able to use attacks_to().
// and to be able to use attackers_to().
Bitboard checkers = pos.checkers();
Bitboard checkersAttacks = EmptyBoardBB;
Bitboard b = checkers & pos.pieces(BISHOP, QUEEN);
@@ -257,9 +257,9 @@ MoveStack* generate_evasions(const Position& pos, MoveStack* mlist, Bitboard pin
while (b1)
{
to = pop_1st_bit(&b1);
// Note that we can use attacks_to() only because we
// Note that we can use attackers_to() only because we
// have already removed slider checkers.
if (!pos.attacks_to(to, them))
if (!pos.attackers_to(to, them))
(*mlist++).move = make_move(ksq, to);
}
@@ -441,7 +441,7 @@ bool move_is_legal(const Position& pos, const Move m, Bitboard pinned) {
// is occupied or under attack.
for (s = Min(from, g1); s <= Max(from, g1); s++)
if ( (s != from && s != to && !pos.square_is_empty(s))
|| pos.attacks_to(s, them))
|| pos.attackers_to(s, them))
illegal = true;
// Check if any of the squares between king and rook
@@ -472,7 +472,7 @@ bool move_is_legal(const Position& pos, const Move m, Bitboard pinned) {
for (s = Min(from, c1); s <= Max(from, c1); s++)
if( (s != from && s != to && !pos.square_is_empty(s))
|| pos.attacks_to(s, them))
|| pos.attackers_to(s, them))
illegal = true;
for (s = Min(to, d1); s <= Max(to, d1); s++)
@@ -942,7 +942,7 @@ namespace {
// It is a bit complicated to correctly handle Chess960
for (s = Min(ksq, s1); s <= Max(ksq, s1); s++)
if ( (s != ksq && s != rsq && pos.square_is_occupied(s))
|| pos.attacks_to(s, them))
|| pos.attackers_to(s, them))
illegal = true;
for (s = Min(rsq, s2); s <= Max(rsq, s2); s++)