Table of Contents

“I love hard questions.”

Demis Hassabis has said this in various interviews, but it’s not just an expression of personal temperament. It’s the declaration of a research strategy.

TL;DR

Behind Hassabis’s preference for “hard questions” is a clear-eyed calculation: the highest-leverage problems are neither the easiest nor the hardest — they’re the ones where solving them unlocks a large amount of subsequent progress. AlphaFold solved the protein folding problem, then hundreds of drug development projects used it to accelerate their own work. AlphaGo solved the Go problem, then the same technical path was applied to materials discovery, mathematical proof, and algorithm optimization. Picking the right problem is more important than solving the problem.

What It Is

A “hard question” preference is actually rare in research institutions. Most research institutions’ incentive systems point in the opposite direction: publish papers, accumulate citations, demonstrate quantifiable progress. These metrics favor selecting “moderately difficult problems with results in a year” over “foundational problems that might produce nothing for a decade.”

Hassabis has been fighting this incentive structure in DeepMind’s research choices: AlphaGo took years from conception to publication; AlphaFold work began in 2018 and only achieved its breakthrough at CASP14 in 2020.

Why It Matters

The “hard question preference” isn’t heroism — it’s a return-on-investment calculation.

The problem with easy questions: if you can solve them, many others can too, and your contribution’s marginal value approaches zero. The return on difficult but high-leverage problems: once solved, they unlock a large number of other things.

Concrete examples:

The protein folding problem: Extremely difficult (nobody solved it for 50 years), but the downstream impact of solving it is acceleration of the entire biomedical research enterprise. How many research projects worldwide shortened their timelines by years because of AlphaFold?

Go AI: Go was considered a game AI couldn’t crack within a decade (before AlphaGo defeated Lee Sedol in 2016). The technology that solved it — deep RL + self-play — was later transferred directly into AlphaFold’s training methodology.

Mathematical proof automation: AlphaGeometry and AlphaProof demonstrated in 2024 that AI can solve Olympiad-level math problems. If AI can assist mathematical research, its influence spans every science that depends on mathematics.

How to Identify “Hard Questions Worth Attacking”

Hassabis has mentioned in interviews how he judges whether a problem is worth investing in:

Evaluate leverage: After solving this problem, how many other problems become solvable or easier? A high-leverage problem’s solution is typically a “methodological breakthrough” — not just an isolated result.

Confirm there’s a quantifiable evaluation function: DeepMind favors problems with objective evaluation criteria — chess has win/loss, protein folding has structural accuracy scores, math problems have correct/incorrect. Problems without objective evaluation functions are hard to attack with AI.

Confirm nobody is attacking it with the right methods: Sometimes a “hard problem” is hard not because of the problem’s intrinsic complexity, but because everyone is using the wrong methods. Using the right tools (deep RL, Transformers) to attack a problem that’s been stuck due to wrong tools can yield breakthroughs faster than the problem’s surface difficulty suggests.

How It Differs from Typical Problem-Solving Thinking

Normal engineering problem-solving: decompose, simplify, find the nearest feasible path. This is the correct methodology in engineering practice.

Research problem selection has a different logic: find the highest-leverage problem first, then consider feasibility. If you’ve chosen the right problem, an “infeasible” problem is often only temporarily infeasible — when the tools catch up, it becomes solvable.

AlphaGo was impossible in 2013-2014 because GPU compute wasn’t there. But when compute arrived in 2015-2016, the problem opened up. DeepMind, having chosen the right problem, was more prepared than competitors who’d chosen easier ones.

Bottom Line

The complete meaning of “I love hard questions” is: I choose to invest my time in problems that, once solved, will generate a large amount of subsequent impact — rather than choosing problems that produce quick results with limited marginal contributions.

For engineers, there’s a borrowable version of this philosophy: in your work, find the core bottleneck where solving it would unlock a large number of other things, and prioritize attacking that — rather than continuously accumulating easy wins with limited downstream impact.

References

Ask this article

Answers come from this article only. Click any prompt below or open the chat at the bottom right.

🇺🇸 English

"I love hard questions." Demis Hassabis has said this in interview after interview — and it's easy to hear that as just a personality trait. Some people like puzzles, right? But that's not what's going on here. When Hassabis says he loves hard questions, he's actually describing a research strategy. A deliberate way of choosing what to work on. And it might be the single biggest reason DeepMind keeps landing breakthroughs at the very frontier of science.

So let's unpack the logic, because it's more calculated than it sounds.

Here's the core idea. The highest-value problems are not the easiest ones — but they're also not simply the hardest ones. They're the problems where solving them unlocks a huge amount of downstream progress. Think of it like a lock that opens a hundred other doors. Take AlphaFold. It cracked the protein folding problem — and then hundreds of drug development projects around the world used it to accelerate their own work. Or AlphaGo: it solved Go, and then that same technical approach got applied to materials discovery, to mathematical proof, to algorithm optimization. So the real lesson is this — picking the right problem matters more than solving the problem.

Now, why is this preference actually rare? Because most research institutions are wired to do the opposite. Their incentive systems reward publishing papers, racking up citations, showing measurable progress. And those metrics push you toward "a moderately hard problem I can get results on within a year" — and away from "a foundational problem that might produce nothing for a decade." Hassabis has essentially been fighting that incentive structure the whole time. AlphaGo took years from idea to publication. AlphaFold started back in 2018 and didn't have its breakthrough moment until CASP14 in 2020. That's a long time to sit with uncertainty.

And this is where I want to be clear — this isn't heroism, it's not some romantic story about struggle. It's a return-on-investment calculation. Watch the logic on both sides. The problem with easy questions is that if you can solve them, so can plenty of other people, which means your marginal contribution shrinks toward zero. But a hard, high-leverage problem? Once you solve it, you unlock a whole bunch of other things that were stuck behind it.

Let me give you the concrete cases. Protein folding — extremely difficult, nobody solved it for fifty years. But the payoff of cracking it was accelerating the entire biomedical research enterprise. How many research projects worldwide shaved years off their timelines because of AlphaFold? A lot. Then there's Go — before AlphaGo beat Lee Sedol in 2016, people genuinely believed AI couldn't crack Go within a decade. And the technology that did it — deep reinforcement learning combined with self-play — got transferred directly into how AlphaFold was trained. And more recently, mathematical proof: in 2024, AlphaGeometry and AlphaProof showed AI could handle Olympiad-level math problems. And if AI can assist mathematical research, its reach extends into every single science that leans on mathematics.

So the natural question becomes — how do you actually spot one of these worth attacking? Hassabis has laid out roughly how he thinks about it, and there are three tests.

First, evaluate the leverage. After you solve this thing, how many other problems become solvable, or at least easier? A truly high-leverage solution is usually a methodological breakthrough — a new way of doing things — not just an isolated one-off result.

Second, confirm there's a quantifiable way to measure success. DeepMind gravitates toward problems with objective scoring. Chess has win or lose. Protein folding has a structural accuracy score. Math problems are right or wrong. If there's no objective evaluation function, it's genuinely hard to attack the problem with AI, because the system needs a clear signal of "am I getting better."

And third — and this one's subtle — confirm that nobody's attacking it with the right methods yet. Sometimes a problem is stuck not because it's intrinsically that complex, but because everyone's been using the wrong tools. So if you show up with the right tools — deep RL, Transformers — against a problem that's been jammed for years because of the wrong approach, you can break through way faster than the surface difficulty would suggest.

Now here's a contrast I find really clarifying. In normal engineering, when you hit a problem, what do you do? You decompose it, you simplify it, you find the nearest feasible path forward. And that's correct — that's good engineering practice. But research problem selection runs on a different logic. You find the highest-leverage problem first, and then you worry about feasibility. Because if you've picked the right problem, "infeasible" often just means "temporarily infeasible." When the tools catch up, it opens.

AlphaGo is the perfect example. It was basically impossible in 2013, 2014 — the GPU compute just wasn't there. But when the compute arrived in 2015, 2016, the problem cracked open. And because DeepMind had already committed to the right problem, they were far more prepared than competitors who'd chosen easier things to work on. They were standing at the door when the key finally showed up.

So let me pull the threads together, because there are a few things worth holding onto here.

Takeaway one: "I love hard questions" really means "I choose to spend my time on problems that, once solved, generate massive downstream impact" — instead of chasing quick wins with limited marginal value. It's a leverage bet, not a difficulty bet.

Takeaway two: the practical filter is those three checks — high leverage, an objective way to measure progress, and the suspicion that the problem's only been stuck because people used the wrong tools.

And takeaway three, the part you can actually borrow: in your own work, look for the core bottleneck — the one thing where solving it would unlock a whole pile of other things — and go after that first. Rather than endlessly stacking up easy wins that don't really move anything downstream. Pick the lock that opens the most doors. That's the whole philosophy.

🇹🇼 中文

網路上流傳一段 Demis Hassabis 的短片,很多人把它拿來當作他的「研究哲學」在解讀。但如果你回到影片本身,會發現它其實沒那麼宏大——這就是一段很輕鬆的訪談花絮,重點不在什麼策略,而在一個科學家被要求「用一個字回答」時,那個很真實的反應。

先說影片裡到底發生了什麼。內容其實很短。主持人先立下規則,說:我們來問幾個簡單的問題,請盡量用一句話回答,有時候甚至只要一個字就好。

結果 Hassabis 的第一反應,不是回答,而是脫口而出:「哇,這好難。」

接著主持人丟出一道二選一——Feynman,還是 Newton?他笑著說:「哇,這更難了。」現場一片笑聲,片段就在這裡結束。沒了,就這麼短。

那為什麼「簡單問題」反而會難?這正是這段花絮有趣的地方。它示範了一個很真實的現象:對一個習慣看見事物複雜面的人來說,「壓縮成一個字」本身,就是最難的部分。

你想想,主持人設計的規則——一句話、甚至一個字——等於是刻意剝奪了他補充脈絡、加上前提、說一句「這要看情況」的空間。而 Feynman 跟 Newton,是兩位在不同時代、不同領域、用完全不同方式改變物理的人。要在這兩個人之間選一個,還不准解釋理由,對任何認真思考過他們的人來說,都不容易。所以 Hassabis 那句「這更難」,與其說是在逃避,不如說是一種誠實。

但這裡要提醒一件事:別把花絮讀成宣言。這段影片裡,其實根本沒有出現任何關於「怎麼挑研究題目」、「槓桿效應」、或哪個問題「一旦解開就能帶動一大片後續進展」的論述。那些都是後來的二次詮釋,是別人加上去的,不是這段素材本身講的話。

如果你只看這段原始影片,能得到的結論其實很單純。

第一,這是一段人設輕鬆、帶著笑聲的快問快答,如此而已。

第二,它捕捉到的,是一位科學家對「過度簡化」的本能抗拒——不是深奧的方法論,就是一個直覺反應。

第三,它不是、也不該被當成一份完整的研究策略陳述。真的想理解 Demis Hassabis 的研究觀點,該去看的是完整的長訪談,或他本人親筆寫的文章,而不是這種數十秒的短片。畢竟,把一個人幾十年的思考壓成十五秒,然後說「這就是他的哲學」——這件事本身,恐怕比 Feynman 還是 Newton 更難。

Tags

Related Articles