X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=e9f31456ac110a88833e92e571bbf046e448ed7c;hp=b9594ba1cf998689596a139300ffc473688a9285;hb=9a542d96981e6cb45b6b01f17258a078cf27da36;hpb=fbdabe2975c0e86a04b01c36c9f3eec5494ecf0d

diff --git a/src/movepick.cpp b/src/movepick.cpp
index b9594ba1..e9f31456 100644
--- a/src/movepick.cpp
+++ b/src/movepick.cpp
@@ -51,12 +51,12 @@ namespace {
   const uint8_t QsearchRecapturesTable[] = { PH_TT_MOVE, PH_QRECAPTURES, PH_STOP };
   const uint8_t ProbCutTable[] = { PH_TT_MOVE, PH_GOOD_PROBCUT, PH_STOP };
 
-  // Unary predicate used by std::partition to split positive scores from ramining
+  // Unary predicate used by std::partition to split positive scores from remaining
   // ones so to sort separately the two sets, and with the second sort delayed.
   inline bool has_positive_score(const MoveStack& move) { return move.score > 0; }
 
   // Picks and pushes to the front the best move in range [firstMove, lastMove),
-  // it is faster then sorting all the moves in advance when moves are few, as
+  // it is faster than sorting all the moves in advance when moves are few, as
   // normally are the possible captures.
   inline MoveStack* pick_best(MoveStack* firstMove, MoveStack* lastMove)
   {