scripod.com

Eric Jang – Building AlphaGo from scratch

Dwarkesh Podcast

Shownote

Eric Jang [https://evjang.com/] walks through how to build AlphaGo from scratch, but with modern AI tools. Sometimes you understand the future better by stepping backward. AlphaGo is still the cleanest worked example of the primitives of intelligence: search, learning from experience, and self-play. You have to go back to 2017 to get insight into how the more general AIs of the future might learn. Once he explained how AlphaGo works, it gave us the context to have a discussion about how RL works in LLMs and how it could work better – naive policy gradient RL has to figure out which of the 100k+ tokens in your trajectory actually got you the right answer, while AlphaGo’s MCTS suggests a strictly better action every single move, giving you a training target that sidesteps the credit assignment problem. The way humans learn is surely closer to the second. Eric also kickstarted an Autoresearch loop on his project. And it was very interesting to discuss which parts of AI research LLMs can already automate pretty well (implementing and running experiments, optimizing hyperparameters) and which they still struggle with (choosing the right question to investigate next, escaping research dead ends). Informative to all the recent discussion about when we should expect an intelligence explosion, and what it would look like from the inside. Watch on YouTube [https://youtu.be/X_ZVSPcZhtw]. Read the transcript [https://www.dwarkesh.com/p/eric-jang]. And check out the flashcards [https://flashcards.dwarkesh.com/eric-jang/] I wrote to retain the insights. Sponsors * Cursor [https://cursor.com/dwarkesh]‘s agent SDK let me build a pipeline to generate flashcards for this episode. For each card, I had an agent read the transcript, ingest blackboard screenshots, generate an SVG visual, and run everything through a critic. A durable agent is much better at this kind of work than a chain of LLM calls, and Cursor’s SDK made it easy. Check out the cards at flashcards.dwarkesh.com [https://flashcards.dwarkesh.com] and get started with the SDK at cursor.com/dwarkesh [https://cursor.com/dwarkesh] * Jane Street [https://janestreet.com/dwarkesh] gave me a real deep-dive tour of one of their datacenters. I got to ask a bunch of questions to Ron Minsky, who co-leads Jane Street’s tech group, and Dan Pontecorvo, who runs Jane Street’s physical engineering team. They were willing to literally pull up the floorboards and take out racks to explain how everything works. Check out the full tour at janestreet.com/dwarkesh [https://janestreet.com/dwarkesh] Timestamps (00:00:00) – Basics of Go (00:08:17) – Monte Carlo Tree Search (00:32:04) – What the neural network does (01:00:33) – Self-play (01:25:38) – Alternative RL approaches (01:45:47) – Why doesn't MCTS work for LLMs (02:01:09) – Off-policy training (02:12:02) – RL is even more information inefficient than you thought (02:22:16) – Automated AI researchers Get full access to Dwarkesh Podcast at www.dwarkesh.com/subscribe [https://www.dwarkesh.com/subscribe?utm_medium=podcast&utm_campaign=CTA_4]

Highlights

In this episode, Eric Jang revisits AlphaGo not as a historical artifact, but as a pedagogical and architectural blueprint for understanding intelligence—particularly how search, learning from experience, and self-play interact to solve problems with vast combinatorial spaces.
02:43
Players can intentionally let opponents capture stones to gain greater advantage elsewhere on the board
11:14
AlphaGo's breakthrough was using neural nets to make the search problem tractable
54:07
MCTS recursively improves its own neural predictions by updating node values and visit counts through backup
1:17:32
Neural networks amortize computation to solve NP-hard problems, challenging traditional hardness assumptions
1:42:24
MCTS and Q-learning share a recursive dynamic programming property that enables value estimation without explicit search.
2:00:02
Strong initialization against Katago reduces the need for architectural tricks and auxiliary supervision objectives
2:07:23
MCTS relabeling replaces target network computation and has a stabilizing effect while better saturating the GPU
2:21:33
In local minima with flat signals, the win rate curve of an MCTS policy versus the raw network provides a clean supervision signal
2:25:22
Mythos-class models and Go-inspired RL environments offer promising paths toward verifiable AI self-improvement

Chapters

Basics of Go
00:00
Monte Carlo Tree Search
08:17
What the neural network does
32:04
Self-play
1:00:33
Alternative RL approaches
1:25:38
Why doesn't MCTS work for LLMs
1:45:47
Off-policy training
2:01:09
RL is even more information inefficient than you thought
2:12:02
Automated AI researchers
2:22:16

Transcript

Dwarkesh Patel: Today, I'm here with Eric Jang, who was most recently vice president of AI at 1x Technologies, before that senior research scientist at what is now Google DeepMind Robotics. And you've been on sabbatical for the last few months. One of the ...