Skip to content
#

monte-carlo-tree-search

Here are 201 public repositories matching this topic...

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

Pytorch Implementation of Stochastic MuZero for gym environment. This algorithm is capable of supporting a wide range of action and observation spaces, including both discrete and continuous variations.

  • Updated Oct 20, 2023
  • Python

Improve this page

Add a description, image, and links to the monte-carlo-tree-search 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 monte-carlo-tree-search topic, visit your repo's landing page and select "manage topics."

Learn more