Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed PlanningJan 1, 2020·G. Parascandolo,L. Buesing,J. Merel,L. Hasenclever,J. Aslanides,J. B. Hamrick,N. Heess,A. Neitz,T. Weber· 0 min read PDF CiteType2PublicationarXiv preprint arXiv:2004.11410Last updated on Jan 1, 2020 ← Combining Q-Learning and Search with Amortized Value Estimates Jan 1, 2020Exploring Exploration: Comparing Children with RL Agents in Unified Environments Jan 1, 2020 →