A very simple implementation of MCTS. Uses a simple heuristic to find the next successor (prioritizing corners and the center).
cern1710 / mcts Goto Github PK
View Code? Open in Web Editor NEWYet another Monte Carlo Tree Search implementation in Python