/// search captures, promotions and some checks) and about how important good
/// move ordering is at the current node.
-MovePicker::MovePicker(const Position& p, bool pv, Move ttm,
- const SearchStack& ss, Depth d) : pos(p) {
+MovePicker::MovePicker(const Position& p, bool pv, Move ttm, Depth d,
+ const History& h, SearchStack* ss) : pos(p), H(h) {
+
pvNode = pv;
ttMove = ttm;
- mateKiller = (ss.mateKiller == ttm)? MOVE_NONE : ss.mateKiller;
- killer1 = ss.killers[0];
- killer2 = ss.killers[1];
+ if (ss)
+ {
+ mateKiller = (ss->mateKiller == ttm)? MOVE_NONE : ss->mateKiller;
+ killer1 = ss->killers[0];
+ killer2 = ss->killers[1];
+ } else
+ mateKiller = killer1 = killer2 = MOVE_NONE;
+
depth = d;
movesPicked = 0;
numOfMoves = 0;
break;
case PH_BAD_CAPTURES:
- // It's probably a good idea to use SEE move ordering here. FIXME
+ // Bad captures SEE value is already calculated by score_captures()
+ // so just sort them to get SEE move ordering.
+ std::sort(badCaptures, badCaptures + numOfBadCaptures);
movesPicked = 0;
break;