- moveStr = move_to_san(p, *m);
- length += moveStr.length() + 1;
- if (breakLines && length > maxLength)
- {
- s << "\n" << std::setw(startColumn) << " ";
- length = moveStr.length() + 1;
- }
- s << moveStr << ' ';
-
- if (*m == MOVE_NULL)
- p.do_null_move(st);
- else
- p.do_move(*m, st);
- }
- return s.str();
-}
-
-
-/// pretty_pv() creates a human-readable string from a position and a PV.
-/// It is used to write search information to the log file (which is created
-/// when the UCI parameter "Use Search Log" is "true").
-
-const string pretty_pv(const Position& pos, int time, int depth,
- Value score, ValueType type, Move pv[]) {
-
- const int64_t K = 1000;
- const int64_t M = 1000000;
-
- std::stringstream s;
-
- // Depth
- s << std::setw(2) << depth << " ";
-
- // Score
- s << (type == VALUE_TYPE_LOWER ? ">" : type == VALUE_TYPE_UPPER ? "<" : " ")
- << std::setw(7) << score_string(score);
-
- // Time
- s << std::setw(8) << time_string(time) << " ";
-
- // Nodes
- if (pos.nodes_searched() < M)
- s << std::setw(8) << pos.nodes_searched() / 1 << " ";
- else if (pos.nodes_searched() < K * M)
- s << std::setw(7) << pos.nodes_searched() / K << "K ";
- else
- s << std::setw(7) << pos.nodes_searched() / M << "M ";
-
- // PV
- s << line_to_san(pos, pv, 30, true);
-
- return s.str();
-}
-
-
-namespace {
-
- Ambiguity move_ambiguity(const Position& pos, Move m) {
-
- MoveStack mlist[MOVES_MAX], *last;
- Move candidates[8];
- Square from = move_from(m);
- Square to = move_to(m);
- Piece pc = pos.piece_on(from);
- int matches = 0, f = 0, r = 0;
-
- // If there is only one piece 'pc' then move cannot be ambiguous
- if (pos.piece_count(pos.side_to_move(), type_of_piece(pc)) == 1)
- return AMBIGUITY_NONE;
-
- // Collect all legal moves of piece 'pc' with destination 'to'
- last = generate<MV_LEGAL>(pos, mlist);
- for (MoveStack* cur = mlist; cur != last; cur++)
- if (move_to(cur->move) == to && pos.piece_on(move_from(cur->move)) == pc)
- candidates[matches++] = cur->move;
-
- if (matches == 1)
- return AMBIGUITY_NONE;
-
- for (int i = 0; i < matches; i++)
- {
- if (square_file(move_from(candidates[i])) == square_file(from))
- f++;
-
- if (square_rank(move_from(candidates[i])) == square_rank(from))
- r++;
- }
-
- return f == 1 ? AMBIGUITY_FILE : r == 1 ? AMBIGUITY_RANK : AMBIGUITY_BOTH;