Skip to content
#

markov-decision-processes

Here are 362 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

Improve this page

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

Learn more