2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #if !defined(MOVE_H_INCLUDED)
21 #define MOVE_H_INCLUDED
30 // Maximum number of allowed moves per position
31 const int MOVES_MAX = 256;
33 /// A move needs 16 bits to be stored
35 /// bit 0- 5: destination square (from 0 to 63)
36 /// bit 6-11: origin square (from 0 to 63)
37 /// bit 12-13: promotion piece type - 2 (from KNIGHT-2 to QUEEN-2)
38 /// bit 14-15: special move flag: promotion (1), en passant (2), castle (3)
40 /// Special cases are MOVE_NONE and MOVE_NULL. We can sneak these in
41 /// because in any normal move destination square is always different
42 /// from origin square while MOVE_NONE and MOVE_NULL have the same
43 /// origin and destination square, 0 and 1 respectively.
56 inline bool operator<(const MoveStack& f, const MoveStack& s) { return f.score < s.score; }
58 // An helper insertion sort implementation, works with pointers and iterators
59 template<typename T, typename K>
60 inline void insertion_sort(K firstMove, K lastMove)
65 if (firstMove != lastMove)
66 for (cur = firstMove + 1; cur != lastMove; cur++)
73 while (--d != firstMove && *--p < value);
79 // Our dedicated sort in range [firstMove, lastMove), first splits
80 // positive scores from ramining then order seaprately the two sets.
82 inline void sort_moves(T* firstMove, T* lastMove, T** lastPositive)
90 d->score = -1; // right guard
92 // Split positives vs non-positives
94 while ((++p)->score > 0) {}
98 while (--d != p && d->score <= 0) {}
107 // Sort just positive scored moves, remaining only when we get there
108 insertion_sort<T, T*>(firstMove, p);
112 // Picks up the best move in range [curMove, lastMove), one per cycle.
113 // It is faster then sorting all the moves in advance when moves are few,
114 // as normally are the possible captures. Note that is not a stable alghoritm.
116 inline T pick_best(T* curMove, T* lastMove)
121 while (++curMove != lastMove)
123 if (bestMove < *curMove)
134 inline Square move_from(Move m) {
135 return Square((int(m) >> 6) & 0x3F);
138 inline Square move_to(Move m) {
139 return Square(m & 0x3F);
142 inline bool move_is_special(Move m) {
143 return m & (3 << 14);
146 inline bool move_is_promotion(Move m) {
147 return (m & (3 << 14)) == (1 << 14);
150 inline int move_is_ep(Move m) {
151 return (m & (3 << 14)) == (2 << 14);
154 inline int move_is_castle(Move m) {
155 return (m & (3 << 14)) == (3 << 14);
158 inline bool move_is_short_castle(Move m) {
159 return move_is_castle(m) && (move_to(m) > move_from(m));
162 inline bool move_is_long_castle(Move m) {
163 return move_is_castle(m) && (move_to(m) < move_from(m));
166 inline PieceType move_promotion_piece(Move m) {
167 return move_is_promotion(m) ? PieceType(((int(m) >> 12) & 3) + 2) : PIECE_TYPE_NONE;
170 inline Move make_move(Square from, Square to) {
171 return Move(int(to) | (int(from) << 6));
174 inline Move make_promotion_move(Square from, Square to, PieceType promotion) {
175 return Move(int(to) | (int(from) << 6) | ((int(promotion) - 2) << 12) | (1 << 14));
178 inline Move make_ep_move(Square from, Square to) {
179 return Move(int(to) | (int(from) << 6) | (2 << 14));
182 inline Move make_castle_move(Square from, Square to) {
183 return Move(int(to) | (int(from) << 6) | (3 << 14));
186 inline bool move_is_ok(Move m) {
187 return move_from(m) != move_to(m); // Catches also MOVE_NONE
192 extern const std::string move_to_uci(Move m, bool chess960);
193 extern Move move_from_uci(const Position& pos, const std::string& str);
194 extern const std::string move_to_san(Position& pos, Move m);
195 extern const std::string pretty_pv(Position& pos, int time, int depth, Value score, ValueType type, Move pv[]);
197 #endif // !defined(MOVE_H_INCLUDED)