Currently, the only example implementation resides in tictactoe_test.go which was very useful for getting the initial implementation of the UCT algorithm working. As the tests indicate, two AIs playing against each other seems to lead to a draw every time.
However, as new implementations of MCTS get added it may be beneficial to have a canonical example of a game to test against, and measure for: complexity, absolute performance, and AI strength. The tic-tac-toe example would work for this purpose, however the search depth and branching factor are not very high at all.
The game Go seems like an ideal example to use for this purpose - I'd appreciate feedback about this, maybe there's a better example to use?