Deep Blue
Chess computerWikipedia
94
MENTIONS
21
EPISODES
21
PODCASTS
Search complete. 94 mentions across 21 episodes found for "Deep Blue".
Oct 27, 2026
Robert WestHOST
It's a very different situation.
Robert WestHOST
But when Garry Kasparov, the world chess champion, was playing Deep Blue, this chess program, and was beaten.
Robert WestHOST
For the first time, a chess grandmaster or chess champion was beaten by a computer.
Robert WestHOST
And it was a total game changer.
Robert WestHOST
But what was really interesting at that time, because chess programs are much, much better now than they were even then.
Robert WestHOST
You know, chess computers would wipe the floor with top chess players nowadays.
Robert WestHOST
But what was interesting was that there was a key point in that game where actually Deep Blue made what was actually a blunder, right? But because it was a computer and because Garry Kasparov couldn't believe that a computer would make a blunder, he didn't think it was a blunder.
Robert WestHOST
And so he spent ages trying to figure out what it was, and he ended up losing the game.
David DemingHOST
Over the years, real chess engines became much more complicated, incorporating not just the next move, but the sequence of possible moves.
David DemingHOST
And Deep Blue, the chess engine that famously beat Garry Kasparov in 1997, could evaluate 200 million positions per second.
David DemingHOST
It was incredibly computationally intensive, but also fundamentally understandable.
David DemingHOST
An engineer could always look inside Deep Blue and find out why it liked a certain move best because the program had an explicit deductive theory of chess.
David DemingHOST
But, I mean, do we really know what matters in chess? What if we're wrong? So rather than writing down Claude Shannon's model or any other complicated model of chess, you could instead show a computer system an enormous number of chess positions and let it discover for itself which patterns predict winning the game.
David DemingHOST
It might rediscover the same evaluation system again, but it also might discover new approaches that we didn't think of.
Dan HeismanGUEST
And, of course, it's hard to become a really good player if you do that.
Dan HeismanGUEST
You have to really work at it.
Dan HeismanGUEST
Another one of the things I talk about, of course, is picking out your time management.
Dan HeismanGUEST
There's a new paradigm in chess today, which is chess.com has 100 million signups or whatever it is, and USCF, U.S.
Dan HeismanGUEST
I did from playing lots of blitz games.
Dan HeismanGUEST
Two, you get that quick tactical eye where you could have to figure out quickly if your moves are safe because you don't have 10 minutes on every move to figure out if your moves are safe.
Dan HeismanGUEST
Three, you work on your time management because in Blitz games, time management is so important.
Dan HeismanGUEST
So you have to keep looking at the clock.
Craig TaylorGUEST
I'm not sure if your podcast, if you've gone into it, but I think we're in this period where we might have an 18 to 24-month window where social engineering and humans become secondary to causes of the major breaches that we see in the news, and the primary cause will be these zero days identified by frontier model scanning software that hasn't been scanned before by AI.
Craig TaylorGUEST
We've came basically to a threshold, a pivot point in software development where humans are like Garry Kasparov playing chess 20 years ago against IBM's Deep Blue.
Craig TaylorGUEST
We might have been good enough for long enough that we could play chess and be the world's greatest, and then IBM Big Blue came along, Deep Blue or Deep Mind, I forget what they called it, and it became the chess champion of the world, and never again will a human beat a computer at chess.
Craig TaylorGUEST
That's happened in software development now.
Craig TaylorGUEST
It's 100% clear to me that humans code insecurely, and AI software and AI coding can do a much better job of identifying, offering fixes, offering patches, and then humans still have to go through that whole process and validate and implement and test and regression test.
Nishanth NottathGUEST
You have a starting point, you've got an ending point.
Nishanth NottathGUEST
It's just like, if you think about it, one of the reasons, the, the, the key reason why IBM Deep Blue, uh, cracked, uh, chess very well-
Graham BarrettHOST
Yeah
Nishanth NottathGUEST
... is because of the fact that, um, there is only 64, uh, blocks in the chess-
John BatchelorHOST
And by the mid-50s, I follow Oliver's reporting, they'd conquered enough to play on a six-by-six board, but not the whole machine.
John BatchelorHOST
It wasn't until the late 20th century that a couple of programs out of Pittsburgh, out of Carnegie Mellon, high-tech and chip test, take us into what we remember now from the late 20th century as IBM's Deep Blue.
John BatchelorHOST
The question of inventing a computer for chess, what is the challenge for all of these inventions finally to play Kasparov in the late 20th century?
Oliver RoederGUEST
Yeah, the main challenge, why this is difficult and literally took centuries, it just has everything to do with the mathematical theory.
Oliver RoederGUEST
Is this a good chess position and then move to another branch? Is this a good chess position? And as I mentioned, the tree is so tall and so thick that you needed you need computers that only existed essentially in the late 20th century, as you say, culminating.
Oliver RoederGUEST
Eventually, with quite literally a supercomputer, one of the fastest computers in the world at the time, it took to perform these searches and these calculations quickly enough to defeat Garry Kasparov in 1997.
Oliver RoederGUEST
And indeed, that was less known as that was Deep Blue's second try.
Oliver RoederGUEST
IBM had challenged Kasparov in 1996 as well.
Ethan MintoHOST
Now, obviously, Steve is going to talk more about this book in essence, but a little bit to kind of get you all excited, to get you thinking, hey, I want to learn more about it.
Ethan MintoHOST
It is also co-written by chess grandmaster Maurice Ashley, and it's illustrated by Tien Pham, and it takes us inside the match between Garry Kasparov and IBM's Deep Blue supercomputer.
Ethan MintoHOST
It's a very interesting, entertaining story.
Ethan MintoHOST
So yeah, welcome back to E-Train Talk, Steve.
13 MINS LATER
Steve SheinkinGUEST
That was absolutely a factor.
Ethan MintoHOST
Yeah, and throughout the book, I mean, you hear from different moves, but in game two, you mentioned that Kasparov gave Deep Blue the chance to grab a couple of pawns.
Ethan MintoHOST
And people around the world, at least based on what they'd previously seen in previous matchups with supercomputers or just, you know, technology in general, they would pounce at the chance to take these pawns.
Ethan MintoHOST
Oh, it's a free piece.
Aki NikolaidisGUEST
Dairy, it's like, I mean, from our small body, it's consuming like 20% of our calories.
Aki NikolaidisGUEST
Now, obviously, like it is capable of doing incredible things, right? Like, you know, people talk about Deep Blue versus Garry Kasparov's.
Aki NikolaidisGUEST
You know, Garry Kasparov was fighting Deep Blue on a, on a granola bar and a cup of coffee.
Aki NikolaidisGUEST
You know what I mean? It's like the calories that he required, you know, no AI is even, is anywhere near matching us on energy expenditure, uh, for compute, right? Like the brain is incredibly efficient at doing compute for the minimum amount of energy.
Aki NikolaidisGUEST
Um.
Steve MigsHOST
Here is your question.
Steve MigsHOST
In 1997, a computer named Deep Blue defeated Gary Kasparov in a game of what? Chat.
Steve MigsHOST
There you go.
Steve MigsHOST
The computers play any other game.
Steve MigsHOST
Is that the litmus test? Yeah, I was just wondering.
Steve MigsHOST
It's always chess.
Steve MigsHOST
Like, there's got to be another game we can take on a computer, beat its ass.
Steve MigsHOST
But for whatever reason, chess is the one game.
Martin BuchananNARRATOR
Surely AlphaGo is creative.
Martin BuchananNARRATOR
When Deep Blue defeated then-reigning world chess champion Garry Kasparov in 1997, it did so by looking six to eight moves ahead per player and evaluating 200 million chess positions per second using rules hard-coded by humans.
Martin BuchananNARRATOR
Go is a vastly more complex game.
Martin BuchananNARRATOR
A stone's worth depends on how distance groups and territory unfold over dozens of moves.
11 more episodes mention Deep Blue.
Create an account to see the whole feed, search across every transcript, and follow the entities you care about.