Watch a computer play checkers against itself, employing Monte Carlo Tree Search as the decision algorithm.
- numpy
Run with:
$ python main.py <starting_player> <seconds_per_turn>
where starting_player == 1 or 2 (denoting player 1 or 2 as the starting player), and seconds_per_turn == amount of seconds each player has to employ Monte Carlo before making a decision each turn.