2 Glaurung, a UCI chess playing engine.
3 Copyright (C) 2004-2008 Tord Romstad
5 Glaurung is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Glaurung is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
34 //// Local definitions
41 MovePicker::MovegenPhase PhaseTable[32];
42 int MainSearchPhaseIndex;
43 int EvasionsPhaseIndex;
44 int QsearchWithChecksPhaseIndex;
45 int QsearchWithoutChecksPhaseIndex;
56 /// Constructor for the MovePicker class. Apart from the position for which
57 /// it is asked to pick legal moves, MovePicker also wants some information
58 /// to help it to return the presumably good moves first, to decide which
59 /// moves to return (in the quiescence search, for instance, we only want to
60 /// search captures, promotions and some checks) and about how important good
61 /// move ordering is at the current node.
63 MovePicker::MovePicker(const Position& p, bool pvnode, Move ttm, Move mk,
64 Move k1, Move k2, Depth d) : pos(p) {
67 mateKiller = (mk == ttm)? MOVE_NONE : mk;
74 dc = p.discovered_check_candidates(p.side_to_move());
77 phaseIndex = EvasionsPhaseIndex;
78 else if(depth > Depth(0))
79 phaseIndex = MainSearchPhaseIndex;
80 else if(depth == Depth(0))
81 phaseIndex = QsearchWithChecksPhaseIndex;
83 phaseIndex = QsearchWithoutChecksPhaseIndex;
85 pinned = p.pinned_pieces(p.side_to_move());
91 /// MovePicker::get_next_move() is the most important method of the MovePicker
92 /// class. It returns a new legal move every time it is called, until there
93 /// are no more moves left of the types we are interested in.
95 Move MovePicker::get_next_move() {
101 // If we already have a list of generated moves, pick the best move from
102 // the list, and return it:
103 move = pick_move_from_list();
104 if (move != MOVE_NONE)
106 assert(move_is_ok(move));
112 switch (PhaseTable[phaseIndex]) {
115 if (ttMove != MOVE_NONE)
117 assert(move_is_ok(ttMove));
118 if (generate_move_if_legal(pos, ttMove, pinned) != MOVE_NONE)
124 if (mateKiller != MOVE_NONE)
126 assert(move_is_ok(mateKiller));
127 if (generate_move_if_legal(pos, mateKiller, pinned) != MOVE_NONE)
132 case PH_GOOD_CAPTURES:
133 numOfMoves = generate_captures(pos, moves);
138 case PH_BAD_CAPTURES:
139 badCapturesPicked = 0;
143 numOfMoves = generate_noncaptures(pos, moves);
149 assert(pos.is_check());
150 numOfMoves = generate_evasions(pos, moves);
156 numOfMoves = generate_captures(pos, moves);
162 numOfMoves = generate_checks(pos, moves, dc);
180 /// A variant of get_next_move() which takes a lock as a parameter, used to
181 /// prevent multiple threads from picking the same move at a split point.
183 Move MovePicker::get_next_move(Lock &lock) {
191 Move m = get_next_move();
199 /// MovePicker::score_captures(), MovePicker::score_noncaptures(),
200 /// MovePicker::score_evasions() and MovePicker::score_qcaptures() assign a
201 /// numerical move ordering score to each move in a move list. The moves
202 /// with highest scores will be picked first by
203 /// MovePicker::pick_move_from_list().
205 void MovePicker::score_captures() {
206 // Winning and equal captures in the main search are ordered by MVV.
207 // Suprisingly, this appears to perform slightly better than SEE based
208 // move ordering. The reason is probably that in a position with a winning
209 // capture, capturing a more valuable (but sufficiently defended) piece
210 // first usually doesn't hurt. The opponent will have to recapture, and
211 // the hanging piece will still be hanging (except in the unusual cases
212 // where it is possible to recapture with the hanging piece). Exchanging
213 // big pieces before capturing a hanging piece probably helps to reduce
215 for (int i = 0; i < numOfMoves; i++)
217 Move m = moves[i].move;
218 moves[i].score = pos.see(m);
219 //if (moves[i].score >= 0)
220 // moves[i].score = move_promotion(m) ? QueenValueMidgame
221 // : pos.midgame_value_of_piece_on(move_to(m));
225 void MovePicker::score_noncaptures() {
227 for (int i = 0; i < numOfMoves; i++)
229 Move m = moves[i].move;
231 moves[i].score = HistoryMax + 2;
232 else if (m == killer2)
233 moves[i].score = HistoryMax + 1;
235 moves[i].score = H.move_ordering_score(pos.piece_on(move_from(m)), m);
237 // Ensure moves in history are always sorted as first
238 if (moves[i].score > 0)
239 moves[i].score += 1000;
241 moves[i].score += pos.mg_pst_delta(moves[i].move);
245 void MovePicker::score_evasions() {
247 for (int i = 0; i < numOfMoves; i++)
249 Move m = moves[i].move;
251 moves[i].score = 2*HistoryMax;
252 else if (!pos.square_is_empty(move_to(m)))
254 moves[i].score = pos.see(m);
255 if (moves[i].score >= 0)
256 moves[i].score += HistoryMax;
259 moves[i].score = H.move_ordering_score(pos.piece_on(move_from(m)), m);
261 // FIXME try psqt also here
264 void MovePicker::score_qcaptures() {
267 for (int i = 0; i < numOfMoves; i++)
269 Move m = moves[i].move;
270 moves[i].score = move_promotion(m) ? QueenValueMidgame
271 : pos.midgame_value_of_piece_on(move_to(m));
276 /// MovePicker::pick_move_from_list() picks the move with the biggest score
277 /// from a list of generated moves (moves[] or badCaptures[], depending on
278 /// the current move generation phase). It takes care not to return the
279 /// transposition table move if that has already been serched previously.
280 /// While picking captures in the PH_GOOD_CAPTURES phase (i.e. while picking
281 /// non-losing captures in the main search), it moves all captures with
282 /// negative SEE values to the badCaptures[] array.
284 Move MovePicker::pick_move_from_list() {
286 int bestScore = -10000000;
290 switch (PhaseTable[phaseIndex]) {
292 case PH_GOOD_CAPTURES:
293 assert(!pos.is_check());
294 assert(movesPicked >= 0);
295 while (movesPicked < numOfMoves)
297 bestScore = -10000000;
299 for (int i = movesPicked; i < numOfMoves; i++)
301 if (moves[i].score < 0)
303 // Losing capture, move it to the badCaptures[] array
304 assert(numOfBadCaptures < 63);
305 badCaptures[numOfBadCaptures++] = moves[i];
306 moves[i--] = moves[--numOfMoves];
308 else if (moves[i].score > bestScore)
311 bestScore = moves[i].score;
314 if (bestIndex != -1) // Found a good capture
316 move = moves[bestIndex].move;
\r
317 moves[bestIndex] = moves[movesPicked++];
319 && move != mateKiller
320 && pos.move_is_legal(move, pinned))
327 assert(!pos.is_check());
328 assert(movesPicked >= 0);
329 while (movesPicked < numOfMoves)
331 // If this is a PV node or we have only picked a few moves, scan
332 // the entire move list for the best move. If many moves have already
333 // been searched and it is not a PV node, we are probably failing low
334 // anyway, so we just pick the first move from the list.
335 if (pvNode || movesPicked < 12)
337 bestScore = -10000000;
339 for (int i = movesPicked; i < numOfMoves; i++)
340 if(moves[i].score > bestScore)
343 bestScore = moves[i].score;
346 bestIndex = movesPicked;
350 move = moves[bestIndex].move;
\r
351 moves[bestIndex] = moves[movesPicked++];
353 && move != mateKiller
354 && pos.move_is_legal(move, pinned))
361 assert(pos.is_check());
362 assert(movesPicked >= 0);
363 while (movesPicked < numOfMoves)
365 bestScore = -10000000;
367 for (int i = movesPicked; i < numOfMoves; i++)
368 if (moves[i].score > bestScore)
371 bestScore = moves[i].score;
376 move = moves[bestIndex].move;
\r
377 moves[bestIndex] = moves[movesPicked++];
383 case PH_BAD_CAPTURES:
384 assert(!pos.is_check());
385 assert(badCapturesPicked >= 0);
386 // It's probably a good idea to use SEE move ordering here, instead
387 // of just picking the first move. FIXME
388 while (badCapturesPicked < numOfBadCaptures)
390 move = badCaptures[badCapturesPicked++].move;
392 && move != mateKiller
393 && pos.move_is_legal(move, pinned))
399 assert(!pos.is_check());
400 assert(movesPicked >= 0);
401 while (movesPicked < numOfMoves)
403 bestScore = -10000000;
404 if (movesPicked < 4) // FIXME makes sens to score qcaps?
407 for (int i = movesPicked; i < numOfMoves; i++)
408 if(moves[i].score > bestScore)
411 bestScore = moves[i].score;
414 bestIndex = movesPicked;
418 move = moves[bestIndex].move;
\r
419 moves[bestIndex] = moves[movesPicked++];
420 if (move != ttMove && pos.move_is_legal(move, pinned))
427 assert(!pos.is_check());
428 assert(movesPicked >= 0);
429 // Perhaps we should do something better than just picking the first
431 while (movesPicked < numOfMoves)
433 move = moves[movesPicked++].move;
434 if (move != ttMove && pos.move_is_legal(move, pinned))
446 /// MovePicker::current_move_type() returns the type of the just
447 /// picked next move. It can be used in search to further differentiate
448 /// according to the current move type: capture, non capture, escape, etc.
449 MovePicker::MovegenPhase MovePicker::current_move_type() const {
450 return PhaseTable[phaseIndex];
454 /// MovePicker::init_phase_table() initializes the PhaseTable[],
455 /// MainSearchPhaseIndex, EvasionPhaseIndex, QsearchWithChecksPhaseIndex
456 /// and QsearchWithoutChecksPhaseIndex variables. It is only called once
457 /// during program startup, and never again while the program is running.
459 void MovePicker::init_phase_table() {
464 MainSearchPhaseIndex = i - 1;
465 PhaseTable[i++] = PH_TT_MOVE;
466 PhaseTable[i++] = PH_MATE_KILLER;
467 PhaseTable[i++] = PH_GOOD_CAPTURES;
468 // PH_KILLER_1 and PH_KILLER_2 are not yet used.
469 // PhaseTable[i++] = PH_KILLER_1;
470 // PhaseTable[i++] = PH_KILLER_2;
471 PhaseTable[i++] = PH_NONCAPTURES;
472 PhaseTable[i++] = PH_BAD_CAPTURES;
473 PhaseTable[i++] = PH_STOP;
476 EvasionsPhaseIndex = i - 1;
477 PhaseTable[i++] = PH_EVASIONS;
478 PhaseTable[i++] = PH_STOP;
480 // Quiescence search with checks
481 QsearchWithChecksPhaseIndex = i - 1;
482 PhaseTable[i++] = PH_QCAPTURES;
483 PhaseTable[i++] = PH_QCHECKS;
484 PhaseTable[i++] = PH_STOP;
486 // Quiescence search without checks
487 QsearchWithoutChecksPhaseIndex = i - 1;
488 PhaseTable[i++] = PH_QCAPTURES;
489 PhaseTable[i++] = PH_STOP;