Go implement of Monte Carlo tree search on five-in-a-row with a terminal UI.
1| | | | | | | |
2| | |●| |●| | |
3| | | |○|○| | |
4|●|○|●|●|○| | |
5| | | | | | | |
6| | | | | | | |
7| | | | | | | |
1 2 3 4 5 6 7
last move: ●(02, 03)
○(row, col)>