I made a surprising discovery. Sorting moves by sub tree size speeds up alphabeta search.

The nice thing about alphabeta, is that it always finds the best move ( in the sense that it will find the same best move, as minimax/negamax would have found, so it won't miss any good continuation or mate ...