X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmove.h;h=223d2a28ef54838c5e1efeeb22b50a9f2e44b273;hp=db2529c3df6effc009688ef2f57fb94c3a105a8a;hb=06c14d0a37c370c1102494aea6a69b5fe4f5250f;hpb=a46b53e1c21ba56b09d7d9e47335d383b5240ce0
diff --git a/src/move.h b/src/move.h
index db2529c3..223d2a28 100644
--- a/src/move.h
+++ b/src/move.h
@@ -17,29 +17,19 @@
along with this program. If not, see .
*/
-
#if !defined(MOVE_H_INCLUDED)
#define MOVE_H_INCLUDED
-////
-//// Includes
-////
-
-#include
+#include
#include "misc.h"
#include "piece.h"
#include "square.h"
+#include "value.h"
// Maximum number of allowed moves per position
const int MOVES_MAX = 256;
-////
-//// Types
-////
-
-class Position;
-
/// A move needs 16 bits to be stored
///
/// bit 0- 5: destination square (from 0 to 63)
@@ -140,9 +130,6 @@ inline T pick_best(T* curMove, T* lastMove)
return bestMove;
}
-////
-//// Inline functions
-////
inline Square move_from(Move m) {
return Square((int(m) >> 6) & 0x3F);
@@ -196,14 +183,15 @@ inline Move make_castle_move(Square from, Square to) {
return Move(int(to) | (int(from) << 6) | (3 << 14));
}
+inline bool move_is_ok(Move m) {
+ return move_from(m) != move_to(m); // Catches also MOVE_NONE
+}
-////
-//// Prototypes
-////
+class Position;
-extern std::ostream& operator<<(std::ostream& os, Move m);
-extern Move move_from_uci(const Position& pos, const std::string &str);
extern const std::string move_to_uci(Move m, bool chess960);
-extern bool move_is_ok(Move m);
+extern Move move_from_uci(const Position& pos, const std::string& str);
+extern const std::string move_to_san(Position& pos, Move m);
+extern const std::string pretty_pv(Position& pos, int time, int depth, Value score, ValueType type, Move pv[]);
#endif // !defined(MOVE_H_INCLUDED)