Use std library to sort moves

[stockfish] / src / position.cpp

diff --git a/src/position.cpp b/src/position.cpp
index 281109b19a34a8ba6d3f6602115d7b61d4cbb43a..cb5370d5b581412af7b800a6ffc891abcca75739 100644 (file)
--- a/src/position.cpp
+++ b/src/position.cpp
@@ -513,14 +513,14 @@ bool Position::pl_move_is_legal(Move m, Bitboard pinned) const {
   assert(piece_color(piece_on(from)) == us);
   assert(piece_on(king_square(us)) == make_piece(us, KING));
 
-  // En passant captures are a tricky special case. Because they are
-  // rather uncommon, we do it simply by testing whether the king is attacked
-  // after the move is made
+  // En passant captures are a tricky special case. Because they are rather
+  // uncommon, we do it simply by testing whether the king is attacked after
+  // the move is made.
   if (move_is_ep(m))
   {
       Color them = opposite_color(us);
       Square to = move_to(m);
-      Square capsq = make_square(square_file(to), square_rank(from));
+      Square capsq = to + Square(us == WHITE ? -8 : 8);
       Square ksq = king_square(us);
       Bitboard b = occupied_squares();