Loterre: IA: Monte Carlo Tree Search

method of artificial intelligence > algorithm > search algorithm > Monte Carlo Tree Search

Monte Carlo Tree Search

Monte-Carlo Tree Search (MCTS) involves simulating numerous random sequences of actions or steps in the resolution of a problem, and assessing the final result on a cost or utility criterion. These simulations lead to the choice of the best first action. Before making this choice, we try to simulate all options at least once (exploration), and the most promising a large number of times (exploitation) to obtain sufficient statistics on their results. MCTS is used in particular in probabilistic planning and games. (Source: translated from https://ia.gdria.fr/Glossaire/monte-carlo-tree-search/ )

http://data.loterre.fr/ark:/67375/23L-NWGGPC6B-H

RDF/XML TURTLE JSON-LD última modificación 5/6/25

Artificial Intelligence Thesaurus