University of Cambridge > > TCM Journal Club > The Deep Blue chess algorithm

The Deep Blue chess algorithm

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Daniel Cole.

In 1997, Deep Blue, a purpose-built IBM computer, defeated Garry Kasparov to become the first ever machine to beat the top-ranked player worldwide.

We discuss briefly the features of the algorithm used in Deep Blue, and even more briefly the manner in which the algorithm was implemented.

The talk is based on: Campbell, Hoan, Hsu, Deep Blue, Artificial Intelligence, Vol. 134, Issues 1-2, January 2002, pp 57-83.

This talk is part of the TCM Journal Club series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity