Skip to content

An AI agent implemented using Monte Carlo Tree Search (MCTS) using Upper Confidence Bounds (UCT).

Notifications You must be signed in to change notification settings

chaitanya100100/AI-Agent-for-Ultimate-Tic-Tac-Toe

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

AI-Agent-for-Ultimate-Tic-Tac-Toe

An AI agent implemented using Monte Carlo Tree Search (MCTS) using Upper Confidence Bounds (UCT).

Game Description

Resources for MCTS and UCT

Test

  • Participated in AI tournament(rules) in which total 90 teams participated. Qualified for semifinals along with 30 teams.
  • Semifinals had 3 pools each having 10 teams. Secured 5th rank in semifinals.

Scope of improvement

  • Backpropogation step of MCTS properly to store heuristic
  • Implementation in C++ instead of Python for more number of simulations
  • Evaluation function

About

An AI agent implemented using Monte Carlo Tree Search (MCTS) using Upper Confidence Bounds (UCT).

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages