X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=5f170297b2a26c9c9cae15f73a9415d33e0a0645;hp=2867e7664716ba32c6b5b0d90284a4e75f8ede15;hb=714069e24839b5111ccf93a3170763c4b383f2dd;hpb=88885399f4a8bdc579c2b75cd892e78821631c63

diff --git a/src/movepick.cpp b/src/movepick.cpp
index 2867e766..5f170297 100644
--- a/src/movepick.cpp
+++ b/src/movepick.cpp
@@ -207,7 +207,7 @@ void MovePicker::score_captures() {
   // capture, capturing a more valuable (but sufficiently defended) piece
   // first usually doesn't hurt.  The opponent will have to recapture, and
   // the hanging piece will still be hanging (except in the unusual cases
-  // where it is possible to recapture with the hanging piece).  Exchanging
+  // where it is possible to recapture with the hanging piece). Exchanging
   // big pieces before capturing a hanging piece probably helps to reduce
   // the subtree size.
   for (int i = 0; i < numOfMoves; i++)
@@ -278,7 +278,7 @@ void MovePicker::score_qcaptures() {
           moves[i].score = QueenValueMidgame;
       else
           moves[i].score = int(pos.midgame_value_of_piece_on(move_to(m)))
-                          -int(pos.midgame_value_of_piece_on(move_to(m))) / 64;
+                          -int(pos.type_of_piece_on(move_from(m)));
   }
 }