An Ultimate-TicTacToe AI with Monte Carlo Tree Search
-
Updated
Apr 14, 2020 - C++
An Ultimate-TicTacToe AI with Monte Carlo Tree Search
A game player for two-player perfect information games, implemented using a min-max game tree, alpha-beta pruning, and a transposition table, along with a variety of heuristics.
Implementation of Tic Tac Toe and AI players using C++. The AI players can use the Minimax algorithm and Monte Carlo Tree Search.
Add a description, image, and links to the game-tree topic page so that developers can more easily learn about it.
To associate your repository with the game-tree topic, visit your repo's landing page and select "manage topics."