Distributed Monte Carlo Tree Search With Applications To Chip Design
Monte Carlo Tree Search is a classic method in AI that builds up a search tree asymmetrically using random rollouts on a game tree. The work detailed in this thesis expands upon traditional implementations by allowing the capability of fully distributing each node onto different physical machines wh...
Main Author: | Jones, Cooper |
---|---|
Other Authors: | Cafarella, Michael |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2023
|
Online Access: | https://hdl.handle.net/1721.1/151671 |
Similar Items
-
Monte Carlo Tree Search Applications to Neural Theorem Proving
by: LaBelle, Ethan
Published: (2024) -
Monte Carlo tree search with Boltzmann exploration
by: Painter, M, et al.
Published: (2023) -
Convex Hull Monte-Carlo tree search
by: Painter, M, et al.
Published: (2020) -
Bi-Directional Monte Carlo Tree Search
by: Spoerer, Kristian
Published: (2021) -
Nonasymptotic Analysis of Monte Carlo Tree Search
by: Shah, Devavrat, et al.
Published: (2022)