Feat: Monte Carlo Tree Search Naive implementation

Could surely be improved by using a Hash map moves -> children for parent child mapping but currently performs well enough (5000 nodes in 10s)