#include <algorithm>
#include <cassert>
+#include <cmath>
#include <cstdlib>
#include <deque>
#include <initializer_list>
votes[th->rootMoves[0].pv[0]] += thread_value(th);
for (Thread* th : threads)
- if (abs(bestThread->rootMoves[0].score) >= VALUE_TB_WIN_IN_MAX_PLY)
+ if (std::abs(bestThread->rootMoves[0].score) >= VALUE_TB_WIN_IN_MAX_PLY)
{
// Make sure we pick the shortest mate / TB conversion or stave off mate the longest
if (th->rootMoves[0].score > bestThread->rootMoves[0].score)