Set the child node of this edge.

Update killer heruistic move.

sigmoid(x) = 1/(1+exp(-x))

* Transformation in the Inverse Cipher that is the inverse of * MixColumns(). */

* Transformation in the Inverse Cipher that is the inverse of * ShiftRows(). */

* Transformation in the Inverse Cipher that is the inverse of * SubBytes(). */

* Transformation in the Cipher that takes all of the columns of the * State and mixes their data (independently of one another) to * produce new col

* Transformation in the Cipher that processes the State by cyclically * shifting the last three rows of the State by different offsets. */

* Transformation in the Cipher that processes the State using a non * linear byte substitution table (S-box) that operates on each of the * State by

Depth reduction for singular move test search

Compute stat score of current move from history table.

tdefl_calculate_minimum_redundancy() originally written by: Alistair Moffat, * alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996.

Simple PNG writer function by Alex Evans, 2011. Released into the public domain: https://gist.github.com/908299, more context at http://altdevblogad

Divisor for max turn time. We generally risk less time on higher depth as search time grows exponentially with the serach depth.