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

Last little touches to movegen

Browse source 
No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2008-10-19 18:19:16 +02:00
parent d7161c1ce6
commit aa94f2f4c2
2 changed files with 38 additions and 39 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

74
src/movegen.cpp
View file

@ -33,7 +33,6 @@
namespace {
struct PawnParams {
Bitboard Rank3BB, Rank8BB;
Rank RANK_8;
SquareDelta DELTA_N, DELTA_NE, DELTA_NW;
@ -66,25 +65,7 @@ namespace {
int generate_piece_blocking_evasions(const Position&, Bitboard, Bitboard, MoveStack*, int);
/// Templates are defined here to avoid lookup issues with specializations
template<PieceType Piece>
int generate_piece_moves(const Position &pos, MoveStack *mlist,
Color side, Bitboard target) {
int n = 0;
for (int i = 0; i < pos.piece_count(side, Piece); i++)
{
Square from = pos.piece_list(side, Piece, i);
Bitboard b = pos.piece_attacks<Piece>(from) & target;
while (b)
{
Square to = pop_1st_bit(&b);
mlist[n++].move = make_move(from, to);
}
}
return n;
}
/// Templates with specializations are defined here to avoid lookup issues
template<PieceType Piece>
int generate_piece_checks(const Position& pos, Bitboard target, Bitboard dc,
@ -134,23 +115,6 @@ namespace {
}
return n;
}
template<PieceType Piece>
int generate_piece_blocking_evasions(const Position& pos, Bitboard b,
Bitboard blockSquares, MoveStack* mlist, int n) {
while (b)
{
Square from = pop_1st_bit(&b);
Bitboard bb = pos.piece_attacks<Piece>(from) & blockSquares;
while (bb)
{
Square to = pop_1st_bit(&bb);
mlist[n++].move = make_move(from, to);
}
}
return n;
}
}
@ -623,6 +587,41 @@ Move generate_move_if_legal(const Position &pos, Move m, Bitboard pinned) {
namespace {
template<PieceType Piece>
int generate_piece_moves(const Position &pos, MoveStack *mlist,
Color side, Bitboard target) {
int n = 0;
for (int i = 0; i < pos.piece_count(side, Piece); i++)
{
Square from = pos.piece_list(side, Piece, i);
Bitboard b = pos.piece_attacks<Piece>(from) & target;
while (b)
{
Square to = pop_1st_bit(&b);
mlist[n++].move = make_move(from, to);
}
}
return n;
}
template<PieceType Piece>
int generate_piece_blocking_evasions(const Position& pos, Bitboard b,
Bitboard blockSquares, MoveStack* mlist, int n) {
while (b)
{
Square from = pop_1st_bit(&b);
Bitboard bb = pos.piece_attacks<Piece>(from) & blockSquares;
while (bb)
{
Square to = pop_1st_bit(&bb);
mlist[n++].move = make_move(from, to);
}
}
return n;
}
template<Color C>
int generate_pawn_captures(const Position& pos, MoveStack* mlist) {
@ -814,6 +813,7 @@ namespace {
return n;
}
template<Color C>
int generate_pawn_blocking_evasions(const Position& pos, Bitboard not_pinned,
Bitboard blockSquares, MoveStack* mlist, int n) {

3
src/movegen.h
View file

@ -36,7 +36,6 @@ extern int generate_noncaptures(const Position &pos, MoveStack *mlist);
extern int generate_checks(const Position &pos, MoveStack *mlist, Bitboard dc);
extern int generate_evasions(const Position &pos, MoveStack *mlist);
extern int generate_legal_moves(const Position &pos, MoveStack *mlist);
extern Move generate_move_if_legal(const Position &pos, Move m,
Bitboard pinned);
extern Move generate_move_if_legal(const Position &pos, Move m, Bitboard pinned);
#endif // !defined(MOVEGEN_H_INCLUDED)