Could we speed up the game!?

When running this code at the core of a stochastic search algorithm such as Monte Carlo Tree Search, it would be good to squeeze more performance of the core "move" method.  Could the performance of the Board class be improved by use of other libraries such as:
- Numpy arrays and matrices, and making use of native methods to move and merge tiles?
- Storing the core Board as a byte array?
