/// -DUSE_POPCNT | Add runtime support for use of popcnt asm-instruction. Works
/// | only in 64-bit mode. For compiling requires hardware with
/// | popcnt support.
-///
-/// -DOLD_LOCKS | Under Windows are used the fast Slim Reader/Writer (SRW)
-/// | Locks and Condition Variables: these are not supported by
-/// | Windows XP and older, to compile for those platforms you
-/// | should enable OLD_LOCKS.
#include <climits>
#include <cstdlib>
#endif
#if defined(_WIN64)
+# include <intrin.h> // MSVC popcnt and bsfq instrinsics
# define IS_64BIT
# define USE_BSFQ
#endif
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 {
DEPTH_ZERO = 0 * ONE_PLY,
DEPTH_QS_CHECKS = -1 * ONE_PLY,
DEPTH_QS_NO_CHECKS = -2 * ONE_PLY,
- DEPTH_QS_RECAPTURES = -4 * ONE_PLY,
+ DEPTH_QS_RECAPTURES = -5 * ONE_PLY,
DEPTH_NONE = -127 * ONE_PLY
};
const Value QueenValueMidgame = Value(0x9D9);
const Value QueenValueEndgame = Value(0x9FE);
-extern const Value PieceValueMidgame[17];
+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);
+}
+
+inline Square operator~(Square s) {
+ return Square(s ^ 56);
+}
inline Value mate_in(int ply) {
return VALUE_MATE - ply;
return Color(p >> 3);
}
-inline Color flip(Color c) {
- return Color(c ^ 1);
-}
-
inline Square make_square(File f, Rank r) {
return Square((r << 3) | f);
}
return Rank(s >> 3);
}
-inline Square flip(Square s) {
- return Square(s ^ 56);
-}
-
inline Square mirror(Square s) {
return Square(s ^ 7);
}
return c == WHITE ? DELTA_N : DELTA_S;
}
-inline Square move_from(Move m) {
+inline Square from_sq(Move m) {
return Square((m >> 6) & 0x3F);
}
-inline Square move_to(Move m) {
+inline Square to_sq(Move m) {
return Square(m & 0x3F);
}
return Move(to | (from << 6));
}
-inline Move make_promotion_move(Square from, Square to, PieceType promotion) {
- return Move(to | (from << 6) | (1 << 14) | ((promotion - 2) << 12)) ;
+inline Move make_promotion(Square from, Square to, PieceType pt) {
+ return Move(to | (from << 6) | (1 << 14) | ((pt - 2) << 12)) ;
}
-inline Move make_enpassant_move(Square from, Square to) {
+inline Move make_enpassant(Square from, Square to) {
return Move(to | (from << 6) | (2 << 14));
}
-inline Move make_castle_move(Square from, Square to) {
+inline Move make_castle(Square from, Square to) {
return Move(to | (from << 6) | (3 << 14));
}
inline bool is_ok(Move m) {
- return move_from(m) != move_to(m); // Catches also MOVE_NULL and MOVE_NONE
+ return from_sq(m) != to_sq(m); // Catches also MOVE_NULL and MOVE_NONE
}
#include <string>
/// 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)