#pragma warning(disable: 4127) // Conditional expression is constant
#pragma warning(disable: 4146) // Unary minus operator applied to unsigned type
#pragma warning(disable: 4800) // Forcing value to bool 'true' or 'false'
+#pragma warning(disable: 4996) // Function _ftime() may be unsafe
// MSVC does not support <inttypes.h>
typedef signed __int8 int8_t;
# include <inttypes.h>
#endif
+#if defined(_WIN32) || defined(_WIN64)
+# include <sys/timeb.h>
+typedef _timeb sys_time_t;
+
+inline void system_time(sys_time_t* t) { _ftime(t); }
+inline uint64_t time_to_msec(const sys_time_t& t) { return t.time * 1000 + t.millitm; }
+#else
+# include <sys/time.h>
+typedef timeval sys_time_t;
+
+inline void system_time(sys_time_t* t) { gettimeofday(t, NULL); }
+inline uint64_t time_to_msec(const sys_time_t& t) { return t.tv_sec * 1000 + t.tv_usec / 1000; }
+#endif
+
#if defined(_WIN64)
# include <intrin.h> // MSVC popcnt and bsfq instrinsics
# define IS_64BIT
typedef uint64_t Bitboard;
const int MAX_MOVES = 256;
-const int MAX_PLY = 100;
+const int MAX_PLY = 256;
const int MAX_PLY_PLUS_2 = MAX_PLY + 2;
const Bitboard FileABB = 0x0101010101010101ULL;
SCALE_FACTOR_NONE = 255
};
-enum ValueType {
- VALUE_TYPE_NONE = 0,
- VALUE_TYPE_UPPER = 1,
- VALUE_TYPE_LOWER = 2,
- VALUE_TYPE_EXACT = VALUE_TYPE_UPPER | VALUE_TYPE_LOWER
+enum Bound {
+ BOUND_NONE = 0,
+ BOUND_UPPER = 1,
+ BOUND_LOWER = 2,
+ BOUND_EXACT = BOUND_UPPER | BOUND_LOWER
};
enum Value {
extern const Value PieceValueMidgame[17]; // Indexed by Piece or PieceType
extern const Value PieceValueEndgame[17];
extern int SquareDistance[64][64];
+extern uint8_t BitCount8Bit[256];
inline Color operator~(Color c) {
return Color(c ^ 1);
return (m & (3 << 14)) == (3 << 14);
}
-inline PieceType promotion_piece_type(Move m) {
+inline PieceType promotion_type(Move m) {
return PieceType(((m >> 12) & 3) + 2);
}
/// Our insertion sort implementation, works with pointers and iterators and is
/// guaranteed to be stable, as is needed.
template<typename T, typename K>
-void sort(K firstMove, K lastMove)
+void sort(K first, K last)
{
- T value;
- K cur, p, d;
-
- if (firstMove != lastMove)
- for (cur = firstMove + 1; cur != lastMove; cur++)
- {
- p = d = cur;
- value = *p--;
- if (*p < value)
- {
- do *d = *p;
- while (--d != firstMove && *--p < value);
- *d = value;
- }
- }
+ T tmp;
+ K p, q;
+
+ for (p = first + 1; p < last; p++)
+ {
+ tmp = *p;
+ for (q = p; q != first && *(q-1) < tmp; --q)
+ *q = *(q-1);
+ *q = tmp;
+ }
}
#endif // !defined(TYPES_H_INCLUDED)