Yuandong is one of several folks who have been working on planning at FAIR.
He explains the difference in applicability between A* (search for shortest path in a graph) and MCTS (search in an exponentially growing tree).

→ View original post on X — @ylecun,