"Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning."

Giambattista Parascandolo et al. (2020)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-04-28

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2004-11410
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2004-11410
Giambattista Parascandolo, Lars Buesing, Josh Merel, Leonard Hasenclever, John Aslanides, Jessica B. Hamrick, Nicolas Heess, Alexander Neitz, Theophane Weber:
Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning. CoRR abs/2004.11410 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.