X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fmovepick.h;h=d49ea3b6a2a995ba0d2a9947265a5f766386293e;hb=c5d478b92303314da0ea072640ee0214ca160199;hp=363b1a1b32327dfb442999a11b8400915460e44e;hpb=f73bb438aa35d6eb6e7fade091e31e878a230465;p=stockfish
diff --git a/src/movepick.h b/src/movepick.h
index 363b1a1b..d49ea3b6 100644
--- a/src/movepick.h
+++ b/src/movepick.h
@@ -17,7 +17,7 @@
along with this program. If not, see .
*/
-#if !defined MOVEPICK_H_INCLUDED
+#ifndef MOVEPICK_H_INCLUDED
#define MOVEPICK_H_INCLUDED
#include // For std::max
@@ -35,7 +35,7 @@
/// and is used for reduction and move ordering decisions. Gains records the move's
/// best evaluation gain from one ply to the next and is used for pruning decisions.
/// Countermoves store the move that refute a previous one. Entries are stored
-/// according only to moving piece and destination square, hence two moves with
+/// using only the moving piece and destination square, hence two moves with
/// different origin but same destination and piece will be considered identical.
template
struct Stats {
@@ -86,7 +86,7 @@ class MovePicker {
public:
MovePicker(const Position&, Move, Depth, const HistoryStats&, Square);
MovePicker(const Position&, Move, const HistoryStats&, PieceType);
- MovePicker(const Position&, Move, Depth, const HistoryStats&, Move*, Search::Stack*, Value);
+ MovePicker(const Position&, Move, Depth, const HistoryStats&, Move*, Search::Stack*);
template Move next_move();
@@ -107,4 +107,4 @@ private:
ExtMove moves[MAX_MOVES];
};
-#endif // !defined(MOVEPICK_H_INCLUDED)
+#endif // #ifndef MOVEPICK_H_INCLUDED