int move_add_pawn(s_board *board, s_move *moves, int from, int to)
{
assert(board != NULL);
assert(moves != NULL);
assert(from >= 0);
assert(from <= 63);
assert(to >= 0);
assert(to <= 63);
if(((uint64_t)1<<to)&(U64_RANK_1|U64_RANK_8))
{
moves[0] = add_promotion_move(board, from, to, PAWNS, QUEENS);
moves[1] = add_promotion_move(board, from, to, PAWNS, KNIGHTS);
moves[2] = add_promotion_move(board, from, to, PAWNS, ROOKS);
moves[3] = add_promotion_move(board, from, to, PAWNS, BISHOPS);
return 4;
}
else
{
moves[0] = add_movecapture(board, from, to, PAWNS);
return 1;
}
}
inline void pawn_move(struct position *pos, struct move_array *m, unsigned char pawns)
{
uint64_t pawn_pos = pos->pieces[pawns];
uint64_t moves;
unsigned char index_to;
switch (pawns & COLOR) {
case WHITE:
// nonpromotion forward moves
moves = moveN(pawn_pos) & ~pos->allpieces & ~rank[7];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move(m, index_to + S, index_to, pawns, nopiece_n);
moves &= notlinboard[index_to];
} else {
break;
}
}
// forward 2 moves
pawn_pos = pos->pieces[pawns];
moves = moveN(moveN(pawn_pos) & ~pos->allpieces) & ~pos->allpieces & rank[3];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move_forward2(m, index_to + S + S, index_to, pawns, nopiece_n);
moves &= notlinboard[index_to];
} else {
break;
}
}
// nonpromotion attack west moves
pawn_pos = pos->pieces[pawns];
moves = moveNW(pawn_pos) & (pos->bpieces | ep_squares[1][pos->ep]) & ~file[7] & ~rank[7];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move(m, index_to + SE, index_to, pawns, find_piece_ep(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
// nonpromotion attack east moves
pawn_pos = pos->pieces[pawns];
moves = moveNE(pawn_pos) & (pos->bpieces | ep_squares[1][pos->ep]) & ~file[0] & ~rank[7];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move(m, index_to + SW, index_to, pawns, find_piece_ep(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
pawn_pos = pos->pieces[pawns];
if ((pawn_pos & rank[6]) == 0) { // no promotion possibilities
return;
} else {
// promotion forward moves
moves = moveN(pawn_pos) & ~pos->allpieces & rank[7];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_promotion_move(m, index_to + S, index_to, pawns, nopiece_n);
moves &= notlinboard[index_to];
} else {
break;
}
}
// promotion attack west moves
pawn_pos = pos->pieces[pawns];
moves = moveNW(pawn_pos) & pos->bpieces & ~file[7] & rank[7];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_promotion_move(m, index_to + SE, index_to, pawns, find_piece(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
// promotion attack east moves
pawn_pos = pos->pieces[pawns];
moves = moveNE(pawn_pos) & pos->bpieces & ~file[0] & rank[7];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_promotion_move(m, index_to + SW, index_to, pawns, find_piece(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
}
break;
default: // black
// nonpromotion forward moves
moves = moveS(pawn_pos) & ~pos->allpieces & ~rank[0];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move(m, index_to + N, index_to, pawns, nopiece_n);
moves &= notlinboard[index_to];
} else {
break;
}
}
// forward 2 moves
pawn_pos = pos->pieces[pawns];
moves = moveS(moveS(pawn_pos) & ~pos->allpieces) & ~pos->allpieces & rank[4];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move_forward2(m, index_to + N + N, index_to, pawns, nopiece_n);
moves &= notlinboard[index_to];
} else {
break;
}
}
// nonpromotion attack west moves
pawn_pos = pos->pieces[pawns];
moves = moveSW(pawn_pos) & (pos->wpieces | ep_squares[0][pos->ep]) & ~file[7] & ~rank[0];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move(m, index_to + NE, index_to, pawns, find_piece_ep(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
// nonpromotion attack east moves
pawn_pos = pos->pieces[pawns];
moves = moveSE(pawn_pos) & (pos->wpieces | ep_squares[0][pos->ep]) & ~file[0] & ~rank[0];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_move(m, index_to + NW, index_to, pawns, find_piece_ep(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
pawn_pos = pos->pieces[pawns];
if ((pawn_pos & rank[1]) == 0) { // no promotion possibilities
return;
} else {
// promotion forward moves
moves = moveS(pawn_pos) & ~pos->allpieces & rank[0];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_promotion_move(m, index_to + N, index_to, pawns, nopiece_n);
moves &= notlinboard[index_to];
} else {
break;
}
}
// promotion attack west moves
pawn_pos = pos->pieces[pawns];
moves = moveSW(pawn_pos) & pos->wpieces & ~file[7] & rank[0];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_promotion_move(m, index_to + NE, index_to, pawns, find_piece(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
// promotion attack east moves
pawn_pos = pos->pieces[pawns];
moves = moveSE(pawn_pos) & pos->wpieces & ~file[0] & rank[0];
for (int i = 0; i < 8; i++) {
if ((index_to = ffsll(moves)) != 0) {
index_to--;
add_promotion_move(m, index_to + NW, index_to, pawns, find_piece(pos, index_to));
moves &= notlinboard[index_to];
} else {
break;
}
}
}
break;
}
}