mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-20 17:16:33 +08:00
Use std::vector<Move> to store UCI search moves
Avoid the ugly and anyhow incorrect hard limit on the maximum number of moves and allow to handle an arbitrary number of moves to search. No functional change. Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
@@ -189,7 +189,7 @@ namespace {
|
||||
|
||||
string token;
|
||||
SearchLimits limits;
|
||||
Move searchMoves[MAX_MOVES], *cur = searchMoves;
|
||||
std::vector<Move> searchMoves;
|
||||
int time[] = { 0, 0 }, inc[] = { 0, 0 };
|
||||
|
||||
while (up >> token)
|
||||
@@ -216,14 +216,14 @@ namespace {
|
||||
up >> limits.maxTime;
|
||||
else if (token == "searchmoves")
|
||||
while (up >> token)
|
||||
*cur++ = move_from_uci(pos, token);
|
||||
searchMoves.push_back(move_from_uci(pos, token));
|
||||
}
|
||||
|
||||
*cur = MOVE_NONE;
|
||||
searchMoves.push_back(MOVE_NONE);
|
||||
limits.time = time[pos.side_to_move()];
|
||||
limits.increment = inc[pos.side_to_move()];
|
||||
|
||||
return think(pos, limits, searchMoves);
|
||||
return think(pos, limits, &searchMoves[0]);
|
||||
}
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user