for (MoveList<LEGAL> it(pos); *it; ++it)
{
if (Root && depth <= ONE_PLY)
- cnt = 1;
+ cnt = 1, nodes++;
else
{
pos.do_move(*it, st, ci, pos.gives_check(*it, ci));
Log log(Options["Search Log Filename"]);
log << "Nodes: " << RootPos.nodes_searched()
<< "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
- << "\nBest move: " << move_to_san(RootPos, RootMoves[0].pv[0]);
-
- StateInfo st;
- RootPos.do_move(RootMoves[0].pv[0], st);
- log << "\nPonder move: " << move_to_san(RootPos, RootMoves[0].pv[1]) << std::endl;
- RootPos.undo_move(RootMoves[0].pv[0]);
+ << "\nBest move: " << move_to_uci(RootMoves[0].pv[0], RootPos.is_chess960())
+ << "\nPonder move: " << move_to_uci(RootMoves[0].pv[1], RootPos.is_chess960())
+ << std::endl;
}
finalize: