This assignment’s goal is to develop an MCTS tree search algorithm for the game tic-tac-toe, and the implemented solution should be effective to beat a random agent. For the random agent, this agent’s moves are purely random at all times.
-
Notifications
You must be signed in to change notification settings - Fork 0
This assignment’s goal is to develop an MCTS tree search algorithm for the game tic-tac-toe, and the implemented solution should be effective to beat a random agent. For the random agent, this agent’s moves are purely random at all times.
qyfHalLu/tic-tac-toe-with-MCTS
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This assignment’s goal is to develop an MCTS tree search algorithm for the game tic-tac-toe, and the implemented solution should be effective to beat a random agent. For the random agent, this agent’s moves are purely random at all times.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published