Fast approximate 2^x. Does only limited range checking. The approximation used here is 2^(N+f) ~ 2^N*(1+f*(1-k+k*f)) where N is the integer and f the

Fast approximate log2(x). Does no range checking. The approximation used here is log2(2^N*(1+f)) ~ N+f*(1+k-k*f) where N is the exponent and f the fra

Returns a child with most visits.

Return the evaluation of the actual best child, regardless of temperature settings. This differs from GetBestMove, which does obey any temperature set

The M utility to use for unvisited nodes.

The M utility to use for unvisited nodes.

Gets pointer to the start of the edge array.

Gets full filename of the file being read.

Returns move from the point of view of the player making it (if as_opponent is false) or as opponent (if as_opponent is true).

Edge related getters.

Not exported.

Number of ply used from the given opening.