- for(i = 0; i < count; i++) {
- UndoInfo u;
- SearchStack ss[PLY_MAX_PLUS_2];
- bool includeMove;
-
- if(includeAllMoves)
- includeMove = true;
- else {
- includeMove = false;
- for(k = 0; searchMoves[k] != MOVE_NONE; k++)
- if(searchMoves[k] == mlist[i].move) {
- includeMove = true;
- break;
- }
- }
-
- if(includeMove) {
- moves[j].move = mlist[i].move;
- moves[j].nodes = 0ULL;
- pos.do_move(moves[j].move, u);
- moves[j].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE,
- Depth(0), 1, 0);
- pos.undo_move(moves[j].move, u);
- moves[j].pv[0] = moves[i].move;
- moves[j].pv[1] = MOVE_NONE; // FIXME
- j++;
- }
+ for (int i = 0; i < lm_count; i++)
+ {
+ bool includeMove = includeAllMoves;
+
+ for (int k = 0; !includeMove && searchMoves[k] != MOVE_NONE; k++)
+ includeMove = (searchMoves[k] == mlist[i].move);
+
+ if (includeMove)
+ {
+ // Find a quick score for the move
+ UndoInfo u;
+ SearchStack ss[PLY_MAX_PLUS_2];
+
+ moves[count].move = mlist[i].move;
+ moves[count].nodes = 0ULL;
+ pos.do_move(moves[count].move, u);
+ moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE,
+ Depth(0), 1, 0);
+ pos.undo_move(moves[count].move, u);
+ moves[count].pv[0] = moves[i].move;
+ moves[count].pv[1] = MOVE_NONE; // FIXME
+ count++;
+ }