Partager cette page :

Monte Carlo Search

le 16 novembre 2022


Campus de Beaulieu Salle Jersey - bât. 12D

Intervention de Tristan Cazenave, enseignant-chercheur à l'Université Paris-Dauphine, laboratoire LAMSADE, dans le cadre des séminaires du département Informatique.


Monte Carlo Search is a family of general search algorithms that have many applications in different domains. It is the state of the art in perfect and imperfect information games. Other applications include the RNA inverse folding problem, Logistics, Multiple Sequence Alignment, General Game Playing, Puzzles, 3D Packing with Object Orientation, Cooperative Pathfinding, Software testing and heuristic Model-Checking. In recent years, many researchers have explored different variants of the algorithms, their relations to Deep Reinforcement Learning and their different applications. The talk will give a broad overview of Monte Carlo Search and of its applications.
Formation, Recherche - Valorisation
David Pichardie

Mise à jour le 9 novembre 2022