kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-01 09:13:08 +00:00
Code Issues Releases Wiki Activity

Rename promotion_piece_type() to promotion_type()

Browse source 
Shorter and equally clear to understand.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2012-02-26 18:31:02 +01:00
parent 96eefc4af6
commit 5bb766e826
4 changed files with 8 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/move.cpp
View file

@ -46,7 +46,7 @@ const string move_to_uci(Move m, bool chess960) {
to = from + (file_of(to) == FILE_H ? Square(2) : -Square(2)); to = from + (file_of(to) == FILE_H ? Square(2) : -Square(2));
if (is_promotion(m)) if (is_promotion(m))
promotion = char(tolower(piece_type_to_char(promotion_piece_type(m)))); promotion = char(tolower(piece_type_to_char(promotion_type(m))));
return square_to_string(from) + square_to_string(to) + promotion; return square_to_string(from) + square_to_string(to) + promotion;
} }
@ -142,7 +142,7 @@ const string move_to_san(Position& pos, Move m) {
if (is_promotion(m)) if (is_promotion(m))
{ {
san += '='; san += '=';
san += piece_type_to_char(promotion_piece_type(m)); san += piece_type_to_char(promotion_type(m));
} }
} }

2
src/movepick.cpp
View file

@ -167,7 +167,7 @@ void MovePicker::score_captures() {
- type_of(pos.piece_moved(m)); - type_of(pos.piece_moved(m));
if (is_promotion(m)) if (is_promotion(m))
cur->score += PieceValueMidgame[promotion_piece_type(m)]; cur->score += PieceValueMidgame[promotion_type(m)];
} }
} }

8
src/position.cpp
View file

@ -518,7 +518,7 @@ bool Position::is_pseudo_legal(const Move m) const {
return move_is_legal(m); return move_is_legal(m);
// Is not a promotion, so promotion piece must be empty // Is not a promotion, so promotion piece must be empty
if (promotion_piece_type(m) - 2 != NO_PIECE_TYPE) if (promotion_type(m) - 2 != NO_PIECE_TYPE)
return false; return false;
// If the from square is not occupied by a piece belonging to the side to // If the from square is not occupied by a piece belonging to the side to
@ -656,7 +656,7 @@ bool Position::move_gives_check(Move m, const CheckInfo& ci) const {
// Promotion with check ? // Promotion with check ?
if (is_promotion(m)) if (is_promotion(m))
return attacks_from(Piece(promotion_piece_type(m)), to, occupied_squares() ^ from) & ksq; return attacks_from(Piece(promotion_type(m)), to, occupied_squares() ^ from) & ksq;
// En passant capture with check ? We have already handled the case // En passant capture with check ? We have already handled the case
// of direct checks and ordinary discovered check, the only case we // of direct checks and ordinary discovered check, the only case we
@ -850,7 +850,7 @@ void Position::do_move(Move m, StateInfo& newSt, const CheckInfo& ci, bool moveI
if (is_promotion(m)) if (is_promotion(m))
{ {
PieceType promotion = promotion_piece_type(m); PieceType promotion = promotion_type(m);
assert(relative_rank(us, to) == RANK_8); assert(relative_rank(us, to) == RANK_8);
assert(promotion >= KNIGHT && promotion <= QUEEN); assert(promotion >= KNIGHT && promotion <= QUEEN);
@ -965,7 +965,7 @@ void Position::undo_move(Move m) {
if (is_promotion(m)) if (is_promotion(m))
{ {
PieceType promotion = promotion_piece_type(m); PieceType promotion = promotion_type(m);
assert(promotion == pt); assert(promotion == pt);
assert(relative_rank(us, to) == RANK_8); assert(relative_rank(us, to) == RANK_8);

2
src/types.h
View file

@ -452,7 +452,7 @@ inline int is_castle(Move m) {
return (m & (3 << 14)) == (3 << 14); return (m & (3 << 14)) == (3 << 14);
} }
inline PieceType promotion_piece_type(Move m) { inline PieceType promotion_type(Move m) {
return PieceType(((m >> 12) & 3) + 2); return PieceType(((m >> 12) & 3) + 2);
} }