github.com/mraufc/mcts (go): Package mcts is a Monte Carlo Tree Search implementation. See https://en.wikipedia.org/wiki/Monte_Carlo_tree_search for more information.  This example demonstrates 2 "AI" players backed with pure Monte Carlo Tree Search playing TicTacToe against each other. First scenario is played on a 3x3 board where 3 in a row vertically, horizontally or diagonally wins the game. With ideal moves, this game should always end in a draw. Second scenario is played on a 4x4 board where 3 in a row vertically, horizontally or diagonally wins the game. With ideal moves, first player (X) should always be able to generate a double attack and win in 3 first player moves or 5 total moves. This example is implemented to allow concurrent gameplays for convenience.
Keywords: go|golang|mcts|monte-carlo-tree-search