Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning (Paper Explained)
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoDetails divide-and-conquer Monte Carlo tree search for planning. Teaches algorithmic technique for combining decomposition with tree search.
Video by Yannic Kilcher, played through YouTube's embedded player.
Part of Reinforcement Learning, Papers Explained