Skip to content
#

mcts

Here are 181 public repositories matching this topic...

AlphaZero implementation for Othello, Connect-Four and Tic-Tac-Toe based on "Mastering the game of Go without human knowledge" and "Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm" by DeepMind.

  • Updated Apr 14, 2018
  • Python

Monte Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space and building a search tree accordingly. It has already had a profound impact on Artificial Intelligence (AI) approaches for domains that can be represented as trees of sequential decisions, particularly games …

  • Updated Mar 10, 2024
  • Python

Improve this page

Add a description, image, and links to the mcts topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the mcts topic, visit your repo's landing page and select "manage topics."

Learn more