The search engine for HexZero is complete!

Over the last few days, I’ve been implementing Monte Carlo Tree Search, which is the algorithm AlphaZero uses to explore possible moves.

Since HeXO has a two-move turns, I had to make some modifications from the original approach, but I think I finally got it working!

With the C++ MCTS implementation complete, the next goal for the project is to make the neural network, that will guide the MCTS on which moves are worth exploring in the first place.