Do not use iterative deepening after move 23.

The branching factor is too small after move 23 for iterative deepening
to be effective. Increase size of killer moves table to allow a complete
search.
Predict the move on which the game will end.

The prediction can only be given if the state is still in the
transposition table and on a complete search.
Remove search heuristics and minor improvements.

Always print the prediction on which move the game will end if the
search was complete. Replace the variable alphaScout in NegaMax with
alpha. Move the depth entry to the always entry when overwriting the
depth entry.
Do not add duplicate killer moves.
Check for forced moves before lookup.

Also check if the current player can win the game in one move before
looking for forced moves.
Add more statistics and improve log layout.

Count how many nodes of each type are searched and measure how early
beta-cutoffs occur. Highlight the number of nodes and nodes per second
statistics.