Monte Carlo Tree Search A very simple implementation of MCTS. Uses a simple heuristic to find the next successor (prioritizing corners and the center).