ClaimsRodney Brooks

“Not so for AlphaGo or Deep Blue, the program that beat Garry Kasparov back in 1997.”

Rodney Brooks, writing on his blog 7 September 2017 [FoR&AI] The Seven Deadly Sins of Predicting the Future of AI (rodneybrooks.com) archived copy

Factual AI capabilities

AlphaGo and Deep Blue (which beat Garry Kasparov in 1997) cannot adapt to a small change in the rules of their game.

Unresolvable The public record could not settle it.

Factual: Statements about the present or the past, checked against the record: did they hold up?

What would count as true or false

True if the documented design of AlphaGo (2015–2017 versions) and of IBM's Deep Blue (which beat Kasparov in the 1997 match) shows that neither could handle a small change to the rules of its game (for example, a different board size or a changed rule) without retraining or reprogramming by humans; and Deep Blue did beat Kasparov in 1997. Mostly true if that holds but a minor detail is off. Mostly false if one of the systems could in fact adapt to small rule changes without retraining. False if both could, or the Kasparov fact is wrong.

Set before the research began.

Evidence (5)

  1. E1 Mastering the game of Go with deep neural networks and tree search - Nature Nature · 27 January 2016

    “These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play.”
  2. E2 Deep Blue | IBM IBM · 10 November 2025

    “In May of that year, it became the first computer system to defeat a reigning world chess champion in a match under standard tournament controls.”
  3. E3 Deep Blue Artificial Intelligence journal (Elsevier), authors Murray Campbell, A. Joseph Hoane Jr., Feng-hsiung Hsu · 2002

    “The opening book in Deep Blue was created by hand, primarily by Grandmaster Joel Benjamin, with assistance from Grandmasters Nick De Firmian, John Fedorowicz, and Miguel Illescas.”
  4. E4 AlphaGo - Wikipedia Wikipedia

    “AlphaGo and its successors use a Monte Carlo tree search algorithm to find its moves based on knowledge previously acquired by machine learning, specifically by an artificial neural network (a deep learning method) by extensive training, both from human and computer play.”
  5. E5 Mastering the game of Go without human knowledge - Nature Nature (Springer Nature) · 19 October 2017

    “Here we introduce an algorithm based solely on reinforcement learning, without human data, guidance or domain knowledge beyond game rules.”

Reasoning

The AlphaGo papers (E1, E5) and the encyclopedia summary (E4) describe how its networks were trained and searched. None of them says whether AlphaGo could handle a changed board size or rule without being retrained. The Deep Blue paper (E3) shows that its opening book was built by hand, but it does not discuss rule changes either. The IBM page (E2) says Deep Blue beat a reigning world champion "in May of that year", but the quote names neither Kasparov nor the year, so even that part of the claim is not established from the quotes. The evidence does not settle the criteria either way.

Cite this claim

Rodney Brooks, “AlphaGo and Deep Blue (which beat Garry Kasparov in 1997) cannot adapt to a small change in the rules of their game.” (said 7 September 2017). Verdict: unresolvable. Reliability API, claim c_5e5234df117f, method 0.1.0+c876030c, dataset release v1.1.2. https://epistacklabs.com/claims/c_5e5234df117f

This claim is in dataset release v1.1.2, with the same verdict.

Reply to this claim

For Rodney Brooks, or someone speaking for them: a correction or counter-evidence. Replies are read before anything is shown; an approved reply shows your name, role, date, statement and link. Your email address is never shown and is deleted 30 days after the decision (privacy).

More factual claims by Rodney Brooks

  1. Mostly true Factual 1 January 2026
    “But since 1991 I have made a distinction between two concepts where a machine, or creature can be either, neither, or both situated and embodied.”

    Since 1991 Brooks has distinguished between situatedness and embodiment as two separate properties a machine or creature can have.

  2. Mostly true Factual 1 January 2026
    “Once the pick orientation and vacuum gripper selection has been made it is really an open loop as all the work is done by the indiscriminate force of suction and the mutual compliance of the gripper…”

    Once pick orientation and vacuum gripper are selected, suction grasping is open loop, relying on suction force and compliance of gripper and object.

  3. Mostly true Factual 1 January 2025
    “Each column from bottom to top is a pure feed forward network, with no search, no iteration, no conventional algorithm at all.”

    In the 2017 'Attention Is All You Need' transformer architecture, each column from bottom to top is a pure feed-forward network with no search, iteration or conventional algorithm.

  4. Mostly true Factual 1 January 2024
    “By March of 2023, it was clear that the next big thing had arrived in AI, and that it was Large Language Models.”

    By March 2023 it was clear that large language models were the next big thing in AI.

  5. Resolved true Factual 18 April 2023
    “@yejinchoinka is providing a “common sense” rebuttal on the @TED stage.”

    Yejin Choi gave a "common sense" rebuttal on the TED stage in April 2023.

All of them

Verdicts are made automatically; how verdicts are made.