X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmovepick.cpp;h=2b20f25f002447861a6deeddbf6260af21114c2b;hp=e9f31456ac110a88833e92e571bbf046e448ed7c;hb=4cc272cb94d0f226fc6af96076e104dfbdf3c4c4;hpb=36bb57a47e137f075fe546887be01fdd0d4670e3 diff --git a/src/movepick.cpp b/src/movepick.cpp index e9f31456..2b20f25f 100644 --- a/src/movepick.cpp +++ b/src/movepick.cpp @@ -96,7 +96,7 @@ MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h, phasePtr = MainSearchTable; } - ttMove = (ttm && pos.move_is_pl(ttm) ? ttm : MOVE_NONE); + ttMove = (ttm && pos.is_pseudo_legal(ttm) ? ttm : MOVE_NONE); phasePtr += int(ttMove == MOVE_NONE) - 1; go_next_phase(); } @@ -117,7 +117,7 @@ MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h, S // Skip TT move if is not a capture or a promotion, this avoids // qsearch tree explosion due to a possible perpetual check or // similar rare cases when TT table is full. - if (ttm != MOVE_NONE && !pos.move_is_capture_or_promotion(ttm)) + if (ttm != MOVE_NONE && !pos.is_capture_or_promotion(ttm)) ttm = MOVE_NONE; } else @@ -127,7 +127,7 @@ MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h, S ttm = MOVE_NONE; } - ttMove = (ttm && pos.move_is_pl(ttm) ? ttm : MOVE_NONE); + ttMove = (ttm && pos.is_pseudo_legal(ttm) ? ttm : MOVE_NONE); phasePtr += int(ttMove == MOVE_NONE) - 1; go_next_phase(); } @@ -138,14 +138,14 @@ MovePicker::MovePicker(const Position& p, Move ttm, const History& h, PieceType assert (!pos.in_check()); // In ProbCut we consider only captures better than parent's move - captureThreshold = piece_value_midgame(Piece(parentCapture)); + captureThreshold = PieceValueMidgame[Piece(parentCapture)]; phasePtr = ProbCutTable; if ( ttm != MOVE_NONE - && (!pos.move_is_capture(ttm) || pos.see(ttm) <= captureThreshold)) + && (!pos.is_capture(ttm) || pos.see(ttm) <= captureThreshold)) ttm = MOVE_NONE; - ttMove = (ttm && pos.move_is_pl(ttm) ? ttm : MOVE_NONE); + ttMove = (ttm && pos.is_pseudo_legal(ttm) ? ttm : MOVE_NONE); phasePtr += int(ttMove == MOVE_NONE) - 1; go_next_phase(); } @@ -251,11 +251,11 @@ void MovePicker::score_captures() { for (MoveStack* cur = moves; cur != lastMove; cur++) { m = cur->move; - cur->score = piece_value_midgame(pos.piece_on(move_to(m))) - - piece_type(pos.piece_on(move_from(m))); + cur->score = PieceValueMidgame[pos.piece_on(move_to(m))] + - type_of(pos.piece_on(move_from(m))); - if (move_is_promotion(m)) - cur->score += QueenValueMidgame; + if (is_promotion(m)) + cur->score += PieceValueMidgame[Piece(promotion_piece_type(m))]; } } @@ -289,9 +289,9 @@ void MovePicker::score_evasions() { m = cur->move; if ((seeScore = pos.see_sign(m)) < 0) cur->score = seeScore - History::MaxValue; // Be sure we are at the bottom - else if (pos.move_is_capture(m)) - cur->score = piece_value_midgame(pos.piece_on(move_to(m))) - - piece_type(pos.piece_on(move_from(m))) + History::MaxValue; + else if (pos.is_capture(m)) + cur->score = PieceValueMidgame[pos.piece_on(move_to(m))] + - type_of(pos.piece_on(move_from(m))) + History::MaxValue; else cur->score = H.value(pos.piece_on(move_from(m)), move_to(m)); } @@ -331,8 +331,7 @@ Move MovePicker::get_next_move() { if (seeValue >= captureThreshold) return move; - // Losing capture, move it to the tail of the array, note - // that move has now been already checked for pseudo legality. + // Losing capture, move it to the tail of the array (--badCaptures)->move = move; badCaptures->score = seeValue; } @@ -348,9 +347,9 @@ Move MovePicker::get_next_move() { case PH_KILLERS: move = (curMove++)->move; if ( move != MOVE_NONE - && pos.move_is_pl(move) + && pos.is_pseudo_legal(move) && move != ttMove - && !pos.move_is_capture(move)) + && !pos.is_capture(move)) return move; break;