Exploration into AI for Game of Go.
- Install Bazel
bazel test //...
It's not much yet, but you can run a rudimentary Monte Carlo Tree Search:
bazel build //zero:mcts_main
bazel-bin/zero/mcts_main --board_size=9
Right now, it just uses a completely random Player (chooses every move with equal chance). But it demonstrates the MCTS algorithm of exploring a playing tree, discounting paths that have already been taken and then choosing the path that was explored the most.