“that the action selection algorithm where you iteratively…” — Dwarkesh Podcast at 1:47:47
“that the action selection algorithm where you iteratively visit and grow the tree is, um, well suited for the size of problem that go is an adept of the problem, but for something like L and reasoning, um, you know, PUC might actually not be a good enough heuristic. It might be too greedy with local tokens,”
0:00
2:37:29