kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-29 16:23:09 +00:00
Code Issues Releases Wiki Activity

Do not special case generate_king_moves()

Browse source 
Teoretically a little slowdown. If after testing we
verify the slowdown has impact on ELO we revert the
change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2008-10-18 09:49:51 +02:00
parent 3b857d1625
commit ea16985ea5
1 changed files with 3 additions and 20 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
src/movegen.cpp
View file

@ -37,7 +37,6 @@ namespace {
int generate_white_pawn_noncaptures(const Position&, MoveStack*);
int generate_black_pawn_noncaptures(const Position&, MoveStack*);
int generate_piece_moves(PieceType, const Position&, MoveStack*, Color side, Bitboard t);
int generate_king_moves(const Position&, MoveStack*, Square from, Bitboard t);
int generate_castle_moves(const Position&, MoveStack*, Color us);
}
@ -65,10 +64,9 @@ int generate_captures(const Position& pos, MoveStack* mlist) {
else
n = generate_black_pawn_captures(pos, mlist);
for (PieceType pce = KNIGHT; pce < KING; pce++)
for (PieceType pce = KNIGHT; pce <= KING; pce++)
n += generate_piece_moves(pce, pos, mlist+n, us, target);
n += generate_king_moves(pos, mlist+n, pos.king_square(us), target);
return n;
}
@ -90,10 +88,9 @@ int generate_noncaptures(const Position& pos, MoveStack *mlist) {
else
n = generate_black_pawn_noncaptures(pos, mlist);
for (PieceType pce = KNIGHT; pce < KING; pce++)
for (PieceType pce = KNIGHT; pce <= KING; pce++)
n += generate_piece_moves(pce, pos, mlist+n, us, target);
n += generate_king_moves(pos, mlist+n, pos.king_square(us), target);
n += generate_castle_moves(pos, mlist+n, us);
return n;
}
@ -1002,6 +999,7 @@ namespace {
return n;
}
int generate_piece_moves(PieceType piece, const Position &pos, MoveStack *mlist,
Color side, Bitboard target) {
@ -1024,21 +1022,6 @@ namespace {
}
int generate_king_moves(const Position &pos, MoveStack *mlist,
Square from, Bitboard target) {
Square to;
Bitboard b;
int n = 0;
b = pos.king_attacks(from) & target;
while(b) {
to = pop_1st_bit(&b);
mlist[n++].move = make_move(from, to);
}
return n;
}
int generate_castle_moves(const Position &pos, MoveStack *mlist, Color us) {
int n = 0;